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

DOI10.1137/0803008zbMath0786.90074OpenAlexW2024483461MaRDI 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 complementarityerror estimatelinear convergencepower methodconvergence analysesmatrix splitting algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

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

This page was built for publication: Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem