A first-order augmented Lagrangian method for constrained minimax optimization

DOI10.1007/S10107-024-02163-3MaRDI QIDQ6932171zbMATH OpenFDO

Authors Zhaosong Lu

Publication date 9 September 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02163-3

zbMATH Keywords

augmented Lagrangian methodfirst-order methodminimax optimizationoperation complexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Cites work

• A primal-dual smoothing framework for max-structured non-convex optimization
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
• Adversarial classification via distributional robustness with Wasserstein ambiguity
• An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
• An augmented Lagrangian approach for sparse principal component analysis
• An augmented Lagrangian method for non-Lipschitz nonconvex programming
• An example comparing the standard and safeguarded augmented Lagrangian methods
• Complexity and performance of an augmented Lagrangian algorithm
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
• Convergence Rates in Forward--Backward Splitting
• Distributed Sparse Linear Regression
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 7625189 (Why is no real title available?)
• Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
• Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
• Nonsmooth Calculus in Finite Dimensions
• Numerical Optimization
• On the complexity of an augmented Lagrangian method for nonconvex optimization
• Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
• Practical augmented Lagrangian methods for constrained optimization
• Prediction, Learning, and Games
• Proximal point methods and nonconvex optimization
• Robustness and regularization of support vector machines
• The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints
• Variance-based regularization with convex objectives

Cited in

(2)

• A first-order method for nonconvex-strongly-concave constrained minimax optimization
• The augmented Lagrangian methods: overview and recent advances

This page was built for publication: A first-order augmented Lagrangian method for constrained minimax optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932171)