Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
From MaRDI portal
(Redirected from Publication:5869812)
Higher-order methods for convex-concave min-max optimization and monotone variational inequalities (scientific article; zbMATH DE number 7594341)
Higher-order methods for convex-concave min-max optimization and monotone variational inequalities (scientific article; zbMATH DE number 7594341)
Recommendations
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Inexact accelerated high-order proximal-point methods
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- An optimal high-order tensor method for convex optimization
Cites work
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Accelerated methods for nonconvex optimization
- Accelerating the cubic regularization of Newton's method on convex problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Cubic regularization of Newton method and its global performance
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis
- Finding approximate local minima faster than gradient descent
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1539037 (Why is no real title available?)
- scientific article; zbMATH DE number 7064064 (Why is no real title available?)
- scientific article; zbMATH DE number 3381131 (Why is no real title available?)
- Implementable tensor methods in unconstrained convex optimization
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Monotone (nonlinear) operators in Hilbert space
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Oracle complexity of second-order methods for smooth convex optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
Cited in
(15)- scientific article; zbMATH DE number 4202039 (Why is no real title available?)
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
- An accelerated stochastic extragradient-like algorithm with new stepsize rules for stochastic variational inequalities
- A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
- Efficient first order method for saddle point problems with higher order smoothness
- Perseus: a simple and optimal high-order method for variational inequalities
- Gradient norm regularization second-order algorithms for solving nonconvex-strongly concave minimax problems
- Fast convergent double inertial subgradient extragradient algorithm with self-adaptive step size for variational inequalities and fixed point problems in Hilbert spaces
- Generalized optimistic methods for convex-concave saddle point problems
- An approximation-based regularized extra-gradient method for monotone variational inequalities
- A continuous-time perspective on global acceleration for monotone equation problems
- A new primal-dual hybrid gradient scheme for solving minimax problems with nonlinear term
- Projective splitting with backward, half-forward and proximal-Newton steps
- Nonsmooth convex-concave saddle point problems with cardinality penalties
This page was built for publication: Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869812)
