arxiv
PublishedJuly 13, 2026 at 4:00 AM
—neutral
Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
Publisher summary· verbatim
arXiv:2607.08954v1 Announce Type: cross Abstract: We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems with a convex-composite structure. In this class, both the objective and the functional inequality constraints are given by convex Li
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCapacity and Redundancy Trade-offs in Multi-Task Learning9harxivPredictive Training with Latent Imagination for Visual Quadruped Navigation9harxivWhere Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making9harxivDid We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection9hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗