Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems

DOI10.1080/10556788.2024.2360040MaRDI QIDQ6644990

Moslem Zamani, E. de Klerk, Hadi Abbaszadehpeivasti

Publication date: 28 November 2024

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Lectures on convex optimization
• Error bounds and convergence analysis of feasible descent methods: A general approach
• From error bounds to the complexity of first-order descent methods for convex functions
• On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
• On lower iteration complexity bounds for the convex concave saddle point problems
• The saddle point problem of polynomials
• Performance of first-order methods for smooth convex minimization: a novel approach
• Linear convergence of first order methods for non-strongly convex optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
• Input–Output Performance of Linear–Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems
• Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
• Conditions for linear convergence of the gradient method for non-convex optimization
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems

This page was built for publication: Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems