Convergence properties of gradient-based methods for minimax problems with nonlinear constraints

DOI10.1007/S10957-026-02964-WMaRDI QIDQ6834809zbMATH OpenFDO

Authors Qingying Hu, Bo Wang, Mengwei Xu

Publication date 31 March 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-026-02964-W

zbMATH Keywords

augmented Lagrangian methodconvergence rategradient-based methodminimax optimizationnonlinear constraints

Mathematics Subject Classification ID

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

Cites work

• A practical relative error criterion for augmented Lagrangians
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Dual extrapolation and its applications to solving variational inequalities and related problems
• First-order convergence theory for weakly-convex-weakly-concave min-max problems
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
• Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
• Multi-agent reinforcement learning: a selective overview of theories and algorithms
• Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
• On gradient-based learning in continuous games
• Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
• Optimality conditions for constrained minimax optimization
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
• Second-order optimality conditions for bi-local solutions of bilevel programs
• The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
• Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning

This page was built for publication: Convergence properties of gradient-based methods for minimax problems with nonlinear constraints

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