Accelerated minimax algorithms flock together
From MaRDI portal
(Redirected from Publication:6663115)
accelerationfirst-order methodsgradient norm reductionminimax optimizationmonotone operatorsrates of convergence
Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Optimality conditions for minimax problems (49K35) Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A forward-backward splitting method for monotone inclusions without cocoercivity
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A modification of the Arrow-Hurwicz method for search of saddle points
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Accelerated methods for saddle-point problem
- Accelerated minimax algorithms flock together
- Accelerated proximal point method for maximally monotone operators
- Accelerated schemes for a class of variational inequalities
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- An extragradient algorithm for monotone variational inequalities
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An optimal gradient method for smooth strongly convex minimization
- 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
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Fixed points of nonexpanding maps
- Golden ratio algorithms for variational inequalities
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3376275 (Why is no real title available?)
- Katyusha: the first direct acceleration of stochastic gradient methods
- Low-cost modification of Korpelevich's methods for monotone equilibrium problems
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Near-optimal no-regret algorithms for zero-sum games
- New extragradient-type methods for general variational inequalities.
- New Proximal Point Algorithms for Convex Minimization
- On lower iteration complexity bounds for the convex concave saddle point problems
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convergence rate of the Halpern-iteration
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Optimal primal-dual methods for a class of saddle point problems
- Optimized first-order methods for smooth convex minimization
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- Projected reflected gradient methods for monotone variational inequalities
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximal splitting methods in signal processing
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Proximité et dualité dans un espace hilbertien
- Shadow Douglas-Rachford splitting for monotone inclusions
- Smooth minimization of non-smooth functions
- Solving strongly monotone variational and quasi-variational inequalities
- Solving variational inequalities with stochastic mirror-prox algorithm
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Training GANs with centripetal acceleration
- Understanding Nesterov's Acceleration via Proximal Point Method
Cited in
(2)
This page was built for publication: Accelerated minimax algorithms flock together
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663115)
