Learning Over-Relaxation Policies for ADMM with Convergence Guarantees

arXiv:2604.26932 · math.OC, cs.LG · Submitted 2026-04-29 · Read on arXiv

math.OC, cs.LG

Submitted: 2026-04-29

Updated: 2026-10-05

Code: https://github.com/JALin2000/learning_over_relaxation_admm

Terminology

• Convergence Guarantees — 2× in this paper · explained in 3 episodes
• Alternating Direction Method of Multipliers — 1× in this paper
• Alternating Direction Method of Multipliers (ADMM) — 1× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Model Predictive Control (MPC) — 1× in this paper · explained in 6 episodes

Sources

• Learning Algorithm Hyperparameters for Fast Parametric Convex Optimization
• Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
• Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guarantees
• Decoupled Weight Decay Regularization

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
• Second-Order Optimization with Asynchronous Curvature
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability