Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
DOI10.1007/s10957-022-02062-7zbMath1492.65181OpenAlexW4284679551MaRDI QIDQ2159456
Alexander A. Titov, Pavel Dvurechensky, Fedor S. Stonyakin, Mohammad S. Alkousa, Alexander V. Gasnikov
Publication date: 1 August 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02062-7
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (global problems) in infinite-dimensional spaces (58E35) Complexity and performance of numerical algorithms (65Y20) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order methods of smooth convex optimization with inexact oracle
- Primal-dual methods for solving infinite-dimensional games
- Universal gradient methods for convex optimization problems
- Solving strongly monotone variational and quasi-variational inequalities
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Modified projection method for strongly pseudomonotone variational inequalities
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Dual extrapolation and its applications to solving variational inequalities and related problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Universal method for stochastic composite optimization problems
- An accelerated directional derivative method for smooth stochastic convex optimization
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- On lower iteration complexity bounds for the convex concave saddle point problems
- Zeroth-order methods for noisy Hölder-gradient functions
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Gradient methods for problems with inexact model of the objective
- Accelerated methods for saddle-point problem
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Implementable tensor methods in unconstrained convex optimization
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Generalized uniformly optimal methods for nonlinear programming
- An adaptive proximal method for variational inequalities
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- Interior projection-like methods for monotone variational inequalities
- Stochastic intermediate gradient method for convex optimization problems
- Accelerated meta-algorithm for convex optimization problems
- Algorithms for computing Minkowski operators and their application in differential games
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Multiuser Optimization: Distributed Algorithms and Error Analysis
- Smooth Optimization with Approximate Gradient
- A universal modification of the linear coupling method
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Inexact basic tensor methods for some classes of convex optimization problems
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
- Inexact model: a framework for optimization and variational inequalities
- Universal intermediate gradient method for convex problems with inexact oracle