Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
From MaRDI portal
(Redirected from Publication:2159456)
Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)
Recommendations
- An adaptive proximal method for variational inequalities
- New version of mirror prox for variational inequalities with adaptation to inexactness
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Solving variational inequalities with stochastic mirror-prox algorithm
- Inexact model: a framework for optimization and variational inequalities
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1187121 (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 3282977 (Why is no real title available?)
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A universal modification of the linear coupling method
- Accelerated meta-algorithm for convex optimization problems
- Accelerated methods for saddle-point problem
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Algorithms for computing Minkowski operators and their application in differential games
- An accelerated directional derivative method for smooth stochastic convex optimization
- An accelerated method for derivative-free smooth stochastic convex optimization
- An adaptive proximal method for variational inequalities
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- First-order methods of smooth convex optimization with inexact oracle
- Generalized uniformly optimal methods for nonlinear programming
- Gradient methods for problems with inexact model of the objective
- Implementable tensor methods in unconstrained convex optimization
- Inexact basic tensor methods for some classes of convex optimization problems
- Inexact model: a framework for optimization and variational inequalities
- Interior projection-like methods for monotone variational inequalities
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- Modified projection method for strongly pseudomonotone variational inequalities
- Multiuser optimization: distributed algorithms and error analysis
- 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 properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Primal-dual methods for solving infinite-dimensional games
- 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 accelerated gradient methods for smooth strongly convex functions
- Smooth Optimization with Approximate Gradient
- Solving strongly monotone variational and quasi-variational inequalities
- Stochastic intermediate gradient method for convex optimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Universal gradient methods for convex optimization problems
- Universal intermediate gradient method for convex problems with inexact oracle
- Universal method for stochastic composite optimization problems
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Zeroth-order methods for noisy Hölder-gradient functions
Cited in
(12)- New version of mirror prox for variational inequalities with adaptation to inexactness
- A novel algorithm with self-adaptive technique for solving variational inequalities in Banach spaces
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
- Inexact model: a framework for optimization and variational inequalities
- Smooth monotone stochastic variational inequalities and saddle point problems: a survey
- Solving a class of variational inequalities with inexact oracle operators
- Accelerated variance-reduced methods for saddle-point problems
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- An adaptive proximal method for variational inequalities
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness
This page was built for publication: Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159456)
