Solve the optimisation problem
Open
@mscroggs is already working on this.
Since Jul 28, 2026.
- Dominant language
- Python
- Stars
- 3
- Forks
- 2
- Avg merge
- 20h 14m
- Merged PRs (30d)
- 1
Description
Solve min/max problem for d over theta subject to $B(\theta) \leqslant B(\theta^*)+\varepsilon$.
See Ricardo's notes for a suggestion of a hacky method for this optimisation.
- Direct Lagrangian method
- Augmented Lagrangian
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Assessment
This issue has not been assessed yet.