arXiv Machine Learning July 13, 2026 By Linglingzhi Zhu, Jiajin Li

Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

safety

arXiv Statistics ML

Sep 16

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints

arXiv:2509.02894v2 Announce Type: replace-cross Abstract: We propose an inexact proximal augmented Lagrangian method (P-ALM) for nonconvex structured optimization problems. The proposed method featur...

By Adeyemi D. Adeoye, Puya Latafat, Alberto Bemporad

arXiv Machine Learning

Sep 15

Equilibrium bias and convergence in augmented primal--dual dynamics with sampled constraints

arXiv:2609.13925v1 Announce Type: cross Abstract: This work studies the stability and convergence of augmented primal-dual dynamics when constraint values are estimated from samples. Unbiased constra...

By Kang Liu, Mengxiao Chen, Siqi Xiong, Yi Xia

safety

arXiv Statistics ML

2d ago

Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization

arXiv:2610.01662v1 Announce Type: cross Abstract: We establish complexity lower bounds for stochastic first-order algorithms in nonconvex--concave minimax optimization, allowing algorithms to use var...

By Jiayi Song, Zi Xu

arXiv Machine Learning

Sep 17

Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization

arXiv:2609. 17973v1 Announce Type: cross Abstract: We introduce a new single-loop algorithmic framework for smooth nonconvex--concave minimax optimization.

By Minghao Zhang, Zi Xu

arXiv AI

Sep 2

Operational Regimes in Non-Convex Optimization: A Multiplier-Based Taxonomy

arXiv:2609.00471v1 Announce Type: cross Abstract: This paper introduces a structural taxonomy for constrained non-convex optimization based on the signature of Lagrange multipliers at KKT stationary...

By Seyed Mohsen Kazemi, Ali Movaghar, Shaahin hessabi

arXiv Machine Learning

5d ago

Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization

arXiv:2609. 30877v1 Announce Type: cross Abstract: We study whether the linear condition-number dependence in the stochastic complexity of SAPD+ is necessary for nonconvex-strongly-concave minimax optimization.

By Qihao Zhou

One email a morning, machine-written

Related stories

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints

Equilibrium bias and convergence in augmented primal--dual dynamics with sampled constraints

Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization

Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization

Operational Regimes in Non-Convex Optimization: A Multiplier-Based Taxonomy

Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization