On linear convergence of iterative methods for the variational inequality problem
- 1 June 1995
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 60 (1-2) , 237-252
- https://doi.org/10.1016/0377-0427(94)00094-h
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity ProblemsMathematics of Operations Research, 1993
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex ProgrammingMathematics of Operations Research, 1993
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity ProblemSIAM Journal on Optimization, 1993
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral SetSIAM Journal on Optimization, 1993
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality ProblemSIAM Journal on Optimization, 1992
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problemsMathematical Programming, 1992
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977