A version of the mirror descent method to solve variational inequalities
From MaRDI portal
Publication:681901
DOI10.1007/S10559-017-9923-9zbMATH Open1384.49014OpenAlexW2603831552MaRDI QIDQ681901FDOQ681901
Authors: Juan-Miguel Gracia 
Publication date: 13 February 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9923-9
Recommendations
- A general descent framework for the monotone variational inequality problem
- A two-stage descent method with optimal step-sizes for monotone variational inequality
- Modified descent-projection method for solving variational inequalities
- A descent method for structured monotone variational inequalities
- Modified descent methods for solving the monotone variational inequality problem
convergenceKullback-Leibler distancepseudomonotonicityvariational inequalityBregman distancemirror descent method
Cites Work
- Linear coupling: an ultimate unification of gradient and mirror descent
- Title not available (Why is that?)
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Interior projection-like methods for monotone variational inequalities
- The ordered subsets mirror descent optimization method with applications to tomography
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Combined relaxation methods for variational inequalities
- Title not available (Why is that?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Solving variational inequalities with stochastic mirror-prox algorithm
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low-cost modification of Korpelevich's methods for monotone equilibrium problems
- A hybrid method without extrapolation step for solving variational inequality problems
- An extragradient algorithm for monotone variational inequalities
- An approximate method of ellipsoids
- Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators
- Hybrid splitting methods for the system of operator inclusions with monotone operators
- Strongly convergent algorithms for variational inequality problem over the set of solutions the equilibrium problems
Cited In (18)
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- An adaptive two-stage proximal algorithm for equilibrium problems in Hadamard spaces
- Stochastic incremental mirror descent algorithms with Nesterov smoothing
- An explicit extragradient algorithm for solving variational inequalities
- Adaptive two-stage Bregman method for variational inequalities
- Adaptive extraproximal algorithm for the equilibrium problem in Hadamard spaces
- Two Bregman projection methods for solving variational inequalities
- Convergence of a two-stage proximal algorithm for the equilibrium problem in Hadamard spaces
- An adaptive algorithm for the variational inequality over the set of solutions of the equilibrium problem
- Modified extragradient-like algorithms with new stepsizes for variational inequalities
- Mirror-Descent Methods in Mixed-Integer Convex Optimization
- Bregman extragradient method with monotone rule of step adjustment
- Modified extragradient method with Bregman distance for variational inequalities
- One-step Bregman projection methods for solving variational inequalities in reflexive Banach spaces
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- Convergence of two-stage method with Bregman divergence for solving variational inequalities
- Inertial hybrid splitting methods for operator inclusion problems
- An improved subgradient extragradient self-adaptive algorithm based on the golden ratio technique for variational inequality problems in Banach spaces
This page was built for publication: A version of the mirror descent method to solve variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681901)
