Cover Image

Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ramirez, Juan, Lacoste-Julien, Simon
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On PI Controllers for Updating Lagrange Multipliers in Constrained Optimization
by: Sohrabi, Motahareh, et al.
Published: (2024)

Position: Adopt Constraints Over Fixed Penalties in Deep Learning
by: Ramirez, Juan, et al.
Published: (2025)

Omega: Optimistic EMA Gradients
by: Ramirez, Juan, et al.
Published: (2023)

Layer-wise Quantization for Quantized Optimistic Dual Averaging
by: Nguyen, Anh Duc, et al.
Published: (2025)

Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization
by: Zheng, Tianqi, et al.
Published: (2024)

Learning Constrained Optimization with Deep Augmented Lagrangian Methods
by: Kotary, James, et al.
Published: (2024)

Optimistic Online Non-stochastic Control via FTRL
by: Mhaisen, Naram, et al.
Published: (2024)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

On Stability in Optimistic Bilevel Optimization
by: Royset, Johannes O.
Published: (2024)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
by: Shi, Qiankun, et al.
Published: (2025)

An Approximate Ascent Approach To Prove Convergence of PPO
by: Doering, Leif, et al.
Published: (2026)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)

Dual Lagrangian Learning for Conic Optimization
by: Tanneau, Mathieu, et al.
Published: (2024)

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)

Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
by: Ahn, Kwangjun, et al.
Published: (2024)

Optimistic Online LQR via Intrinsic Rewards
by: Bartos, Marcell, et al.
Published: (2026)

Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis
by: Kim, Kaheon, et al.
Published: (2025)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
by: Lin, Tianyi, et al.
Published: (2024)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
by: Gao, Hongchang
Published: (2022)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
by: Yan, Yu-Hu, et al.
Published: (2025)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Mirror Descent-Ascent for mean-field min-max problems
by: Lascu, Razvan-Andrei, et al.
Published: (2024)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
by: Tran-Dinh, Quoc, et al.
Published: (2023)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2024)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

Boosting Gradient Ascent for Continuous DR-submodular Maximization
by: Zhang, Qixin, et al.
Published: (2024)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Wasserstein Contraction of Coordinate Ascent Variational Inference
by: Caprio, Rocco, et al.
Published: (2026)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
by: Huang, Yankun, et al.
Published: (2025)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Policy-based Primal-Dual Methods for Concave CMDP with Variance Reduction
by: Ying, Donghao, et al.
Published: (2022)

A Computational Framework for Solving Wasserstein Lagrangian Flows
by: Neklyudov, Kirill, et al.
Published: (2023)

On Linear Convergence of PI Consensus Algorithm under the Restricted Secant Inequality
by: Chakrabarti, Kushal, et al.
Published: (2023)