On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
From MaRDI portal
Publication:2340520
DOI10.1007/s10589-014-9673-9zbMath1311.49020arXiv1311.2776OpenAlexW2110412969MaRDI QIDQ2340520
Publication date: 20 April 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2776
complexityextragradient methodsmonotone variational inequalityprox-mappingnon-Euclidean methodspseudo-monotone variational inequality
Related Items (max. 100)
Computing dynamic user equilibrium on large-scale networks without knowing global parameters ⋮ Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ Minibatch Forward-Backward-Forward Methods for Solving Stochastic Variational Inequalities ⋮ Accelerated schemes for a class of variational inequalities ⋮ Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation ⋮ Universal Conditional Gradient Sliding for Convex Optimization ⋮ The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces ⋮ A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems ⋮ Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes ⋮ On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes ⋮ Global Convergence of Policy Gradient Methods to (Almost) Locally Optimal Policies ⋮ Forward-reflected-backward method with variance reduction ⋮ A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints ⋮ An infeasible stochastic approximation and projection algorithm for stochastic variational inequalities ⋮ Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants ⋮ On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems ⋮ Variance-based single-call proximal extragradient algorithms for stochastic mixed variational inequalities ⋮ Variance-based subgradient extragradient method for stochastic variational inequality problems ⋮ A fast stochastic approximation-based subgradient extragradient algorithm with variance reduction for solving stochastic variational inequality problems ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal method for stochastic composite optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- 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
- The gap function of a convex program
- Introductory lectures on convex optimization. A basic course.
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On the existence of solutions to stochastic quasi-variational inequality and complementarity problems
- Iteration-complexity of first-order penalty methods for convex programming
- Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
- Interior projection-like methods for monotone variational inequalities
- Lectures on Modern Convex Optimization
- Two-Metric Projection Methods for Constrained Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- A New Projection Method for Variational Inequality Problems
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Bregman Monotone Optimization Algorithms
- 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
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
This page was built for publication: On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
