On linear convergence of iterative methods for the variational inequality problem
From MaRDI portal
Publication:1900764
DOI10.1016/0377-0427(94)00094-HzbMath0835.65087OpenAlexW2075226379MaRDI QIDQ1900764
Publication date: 23 October 1995
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(94)00094-h
variational inequalitieserror boundsiterative methodslinear convergencematrix splittingdescent methodextragradient methodproximal point method
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Methods of reduced gradient type (90C52) Mathematical programming (90C99)
Related Items
Some recent advances in projection-type methods for variational inequalities, Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems, An improved two-sweep iteration method for absolute value equations, A generalized Newton method for non-Hermitian positive definite linear complementarity problem, Some developments in general variational inequalities, New trends in general variational inequalities, On a class of nonconvex equilibrium problems, New First-Order Algorithms for Stochastic Variational Inequalities, Gap functions and global error bounds for history-dependent variational-hemivariational inequalities, An introduction to vector variational inequalities and some new results, Cubic regularized Newton method for the saddle point models: a global and local convergence analysis, Modified descent-projection method for solving variational inequalities, An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems, Modulus-based matrix splitting algorithms for the quasi-complementarity problems, ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES, An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems, Error bounds in mathematical programming, A class of combined iterative methods for solving variational inequalities, Unnamed Item, Modified projection methods for solving multi-valued variational inequality without monotonicity, Convergence rate of a modified extragradient method for pseudomonotone variational inequalities, Convergence analysis of perturbed feasible descent methods, Convergence rate of a gradient projection method for solving variational inequalities, Strong convergence of projected reflected gradient methods for variational inequalities, A modified projection method for solving co-coercive variational inequalities, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm, On Korpelevich's extragradient algorithm, Gap functions and global error bounds for differential variational-hemivariational inequalities, An adaptive block iterative process for a class of multiple sets split variational inequality problems and common fixed point problems in Hilbert spaces, The landscape of the proximal point method for nonconvex-nonconcave minimax optimization, Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds, Unnamed Item, Smooth monotone stochastic variational inequalities and saddle point problems: a survey, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Some new projection methods for variational inequalities, A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem, On a solution method in indefinite quadratic programming under linear constraints, Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions, Golden ratio algorithms for variational inequalities, Unnamed Item, Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems, An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems, From Representation Theorems to Variational Inequalities, Unnamed Item, A Modulus Iteration Method for SPSD Linear Complementarity Problem Arising in Image Retinex, Modified extragradient method for pseudomonotone variational inequalities in infinite dimensional Hilbert spaces, Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure, Convergence analysis of an iterative algorithm for the extended regularized nonconvex variational inequalities, A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework, On the convergence of combined relaxation methods for variational inequalties, Modified fixed-point equations and related iterative methods for variational inequalities, New extragradient-type methods for solving variational inequalities, Halpern projection methods for solving pseudomonotone multivalued variational inequalities in Hilbert spaces, Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM, Unified framework of extragradient-type methods for pseudomonotone variational inequalities., Affine minimax variational inequalities and matrix two-person games, Convergence of one-step projected gradient methods for variational inequalities, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems, Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods, Tensor variational inequalities: theoretical results, numerical methods and applications to an economic equilibrium model, A note on the MSMAOR method for linear complementarity problems, Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems, The improved convergence of MSMMAOR method for linear complementarity problems, Local convergence analysis of projection-type algorithms: unified approach, Proximal methods for mixed variational inequalities, Proximal methods for mixed quasivariational inequalities, Modulus-based matrix splitting iteration methods for linear complementarity problems, The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems, A New Extragradient Method for Strongly Pseudomonotone Variational Inequalities, A subgradient proximal method for solving a class of monotone multivalued variational inequality problems, Modified extragradient methods for solving variational inequalities, Projected Reflected Gradient Methods for Monotone Variational Inequalities, Projection methods for monotone variational inequalities, An infeasible projection type algorithm for nonmonotone variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- On the convergence of a basic iterative method for the implicit complementarity problem
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Solution of symmetric linear complementarity problems by iterative methods
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Two-Metric Projection Methods for Constrained Optimization
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Normal Maps Induced by Linear Transformations
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems