An LP-based successive overrelaxation method for linear complementarity problems

DOI10.1007/BF00938311zbMath0628.90082OpenAlexW102562363MaRDI QIDQ1093555

Tzong-Huei Shiau

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00938311

zbMATH Keywords

successive overrelaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

An experimental investigation of enumerative methods for the linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• On the convergence of a basic iterative method for the implicit complementarity problem
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: the block partitioned case
• A dual differentiable exact penalty function
• Error bounds for monotone linear complementarity problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities