arXiv (All)
open access
ADSWITCH: A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization
A very simple first-order algorithm is proposed for solving nonlinear optimization problems with deterministic nonlinear equality constraints. This algorithm adaptively selects steps in the plane tangent to the constraints or steps that reduce infeasibility, without using a merit function or filter.
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
- An interacting particle consensus method for constrained global optimization#1117199
- Multi-ResNets for Subspace Preconditioning in Constrained Optimization#259525
- Optimal Deterministic First-Order Oracle Complexity for Nonconvex-Concave Minimax Optimization#1083692
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- On the Complexity of BFGS Method for Smooth Convex Optimization#617183
Record · ID 1400795
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