Samplinglib · research resources
Optimisation
Follow an optimization proof from its objective and access model to a quantitative guarantee. Browse mathematical foundations separately from formal libraries, AI tools and new papers.
Choose a reading route
Optimisation
Chewi's Lectures on Optimization; formal-upstream reuse
Keep the argument inspectable
Specify the problem
State the feasible set, geometry, convexity and smoothness assumptions. Fix the oracle and whether the guarantee is an objective gap, stationarity or feasibility.
Choose the mechanism
Start with a one-step descent or potential inequality. Distinguish gradient, proximal, mirror, accelerated and block methods rather than treating all convergence proofs as interchangeable.
Check the guarantee
Track constants, step sizes, initialization and the actual oracle count. Read lower bounds and counterexamples under the same access model.
External methods and theorem candidates are reference material. Existing local proofs and source coverage are reported only by their canonical publication pages.
Formal libraries and reusable techniques
Optlib: five areas, complete module index and existing local matches · Current source-aligned chapter progress