Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem

DOI10.1137/0803008zbMath0786.90074MaRDI QIDQ4697313

Wu Li

Publication date: 29 June 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803008

zbMATH Keywords

linear complementarity; error estimate; linear convergence; power method; convergence analyses; matrix splitting algorithms

Mathematics Subject Classification ID

90C20: Quadratic programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, Error bounds and convergence analysis of feasible descent methods: A general approach, Gauss-Seidel method for least-distance problems, Error bounds for inconsistent linear inequalities and programs, Descent methods with linesearch in the presence of perturbations, Error bounds in mathematical programming, Convergence analysis of perturbed feasible descent methods, Some recent advances in projection-type methods for variational inequalities, On linear convergence of iterative methods for the variational inequality problem, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization