Accelerate heuristic bound solve
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Python
- Stars
- 1
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
The current way to enforce bounds while unfixing the uptime uses dual ascent on the max and min of the continuous portion of the load. This can be accelerated a number of ways using more effective first-order methods.
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.
Research direction
No files, tests, or entry points are named. Start by locating the dual-ascent implementation that enforces bounds using the maximum and minimum of the continuous load, then review suitable first-order acceleration methods. Done should mean a faster bound solve that preserves the existing behavior, with relevant performance or correctness checks.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100