First-order convergence theory for weakly-convex-weakly-concave min-max problems
From MaRDI portal
Publication:5159451
Authors: Ming-rui Liu, Hassan Rafique, Qihang Lin, Tianbao Yang 
Publication date: 27 October 2021
Full work available at URL: https://arxiv.org/abs/1810.10207
Recommendations
- Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
- Two steps at a time-taking GAN training in stride with Tseng's method
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
variational inequalitymin-maxfirst-order convergencegenerative adversarial netsweakly-convex-weakly-concave
Cites Work
- Robust Stochastic Approximation Approach to Stochastic Programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust linear least squares regression
- Monotone (nonlinear) operators in Hilbert space
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On some non-linear elliptic differential functional equations
- Monotone Operators and the Proximal Point Algorithm
- Most tensor problems are NP-hard
- Solving strongly monotone variational and quasi-variational inequalities
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Title not available (Why is that?)
- A New Projection Method for Variational Inequality Problems
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Title not available (Why is that?)
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
- The proximal point method for nonmonotone variational inequalities
- Saddle-point dynamics: conditions for asymptotic stability of saddle points
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- An efficient primal dual prox method for non-smooth optimization
- Extragradient Method with Variance Reduction for Stochastic Variational Inequalities
Cited In (5)
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
- A quasi-Newton subspace trust region algorithm for nonmonotone variational inequalities in adversarial learning over box constraints
- Perseus: a simple and optimal high-order method for variational inequalities
- Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems
Uses Software
This page was built for publication: First-order convergence theory for weakly-convex-weakly-concave min-max problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159451)
