arXiv (All)
open access
Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems under local multiplier regularity. Both the objective and functional inequality constraints are compositions of convex Lipschitz outer functions with smooth nonlinear mappings. Unlike
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
- Fast Rates and Strong Convergence of Tikhonov-Regularized Mixed-Order Primal-Dual Dynamics for Linearly Constrained Optimization Without Eventual Ball Conditions#973999
- Efficient Parameter-Free First-Order Methods for Nonsmooth Composite Minimax Optimization#1061385
- Lower Bounds for Nonconvex-Concave Minimax Optimization#1083690
- On the Absence of Identifiable Manifolds in Finite-Max Composite Optimization#625247
Record · ID 1356116
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