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

arXiv:2509.02894 · math.OC, stat.ML · Submitted 2025-09-02 · Read on arXiv

math.OC, stat.ML

Submitted: 2025-09-02

Updated: 2026-09-15

Code: https://github.com/adeyemiadeoye/p-balm

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regularization — 4× in this paper · explained in 3 episodes
• Objective Function — 3× in this paper · explained in 2 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Quadratic Programming (QP) — 2× in this paper · explained in 2 episodes
• System Identification — 2× in this paper · explained in 3 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• IEEE Conference on Decision and Control — 1× in this paper
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• The inexact power augmented Lagrangian method for constrained nonconvex optimization

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification