A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
From MaRDI portal
Publication:6110456
DOI10.1007/s10107-022-01919-zzbMath1522.90261arXiv2006.02032MaRDI QIDQ6110456
No author found.
Publication date: 1 August 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02032
machine learningminimax optimization problemiteration complexitysingle-loop algorithmalternating gradient projection algorithm
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (4)
Zeroth-order single-loop algorithms for nonconvex-linear minimax problems ⋮ Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems ⋮ Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Gradient methods for minimizing composite functions
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Subgradient methods for saddle-point problems
- Introductory lectures on convex optimization. A basic course.
- Accelerated schemes for a class of variational inequalities
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- First-order and stochastic optimization methods for machine learning
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Distributed Sparse Linear Regression
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning
- Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Decentralized Learning for Wireless Communications and Networking
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
This page was built for publication: A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
