arXiv (All)
open access
Local LMO is Secretly a Projection Method!
The local linear minimization oracle (Ferris and Zavriev, 1996; arXiv:2605.08850), or Local LMO, solves constrained convex problems without having to compute a projection: it minimizes a linear model over the intersection of the feasible set with a ball around the current iterate. We show that, when
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A DC-Reformulation for Gradient-$L^0$-Constrained Problems#1142541
- An inexact variable metric proximal linearization method for composite optimization on manifolds#1156203
- ElastiQP: An Always-Feasible QP Solver for Constrained Robot Control#1013288
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- Sufficient optimality conditions in bilevel programming#196253
Record · ID 1118095
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive