The landscape of the proximal point method for nonconvex-nonconcave minimax optimization

DOI10.1007/s10107-022-01910-8zbMath1522.90258arXiv2006.08667OpenAlexW3118100023MaRDI QIDQ6110439

Pratik Worah, Benjamin Grimmer, Haihao Lu, Vahab S. Mirrokni

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.08667

zbMATH Keywords

minimax optimizationlinear convergencenonconvexcyclingproximal point methodMoreau envelopenonconcave

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35) Numerical methods for variational inequalities and related problems (65K15)

Related Items (3)

The landscape of the proximal point method for nonconvex-nonconcave minimax optimization ⋮ A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems ⋮ Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Maximal monotone relations and the second derivatives of nonsmooth functions
• Convergence of approximate saddle points
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On linear convergence of iterative methods for the variational inequality problem
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A Convergence Theory for Saddle Functions
• Generalized Second Derivatives of Convex Functions and Saddle Functions
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• On penalty methods for minimax problems
• Monotone Operators and the Proximal Point Algorithm
• Stochastic Model-Based Minimization of Weakly Convex Functions
• 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
• Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
• The landscape of the proximal point method for nonconvex-nonconcave minimax optimization

This page was built for publication: The landscape of the proximal point method for nonconvex-nonconcave minimax optimization