arXiv (All)
open access
On error bounds and noncritical Lagrange multipliers
Critical Lagrange multipliers are known to be responsible for the potentially slow convergence of Newton-type methods, and noncriticality of a given multiplier has been tied to an error bound which estimates the distance of a primal-dual pair associated with a perturbed problem to the primal solutio
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
- The Iterates of Nesterov's Accelerated Algorithm Converge in The Critical Regimes#1108962
- Sharp $L^2$-Caffarelli--Kohn--Nirenberg and weighted Poincaré inequalities on half-spaces and orthants and their stability#625356
- Sharp $L^2$-Caffarelli--Kohn--Nirenberg and weighted Poincaré inequalities on half-spaces and orthants and their stability#623083
- Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method#629792
- Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method#627930
Record · ID 1248771
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