Output a feasible point
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 71
- Forks
- 27
- Avg merge
- 2d 18h
- Merged PRs (30d)
- 33
Description
VMCON and PyVMCON frequently fail to converge.
Proposed solution
VMCON has an algorithm to find a feasible point to the linearized constraints (a solution vector that satisfies the constraints) as a starting point for each iteration. (PyVMCON does not seem to have this.) It would be a spiffing idea to store the first feasible point found (if there is one) and output it if the optimiser fails.
Drawbacks
We would need to find the relevant bit of code in VMCON. Also, VMCON is not allowed in the GitHub repository.
@jonmaddock @timothy-nunn
Contributor guide
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.
Research direction
Start by locating the PyVMCON implementation and the VMCON logic that finds feasible points for linearized constraints; the issue notes that VMCON is not available in this repository. Determine how a feasible point can be retained and returned when optimization fails, then add coverage showing that behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100