Conjugate gradient method for the linear complementarity problem withs-matrix

DOI10.1016/j.mcm.2007.10.017zbMath1156.90446MaRDI QIDQ1007676

Dong-hui Li, Jin-ping Zeng, Yi-Yong Nie, Qing-Na Li

Publication date: 23 March 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.10.017

zbMATH Keywords

linear complementarity problem; conjugate gradient method; \(S\)-matrix

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

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

90C52: Methods of reduced gradient type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of finiteness of Murty's principal pivoting algorithm
• A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
• Gaussian pivoting method for solving linear complementarity problem
• A New Active Set Algorithm for Box Constrained Optimization
• Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
• Minkowski matrices.
• Linear complementarity problems solvable by A single linear program
• On the Accurate Identification of Active Constraints
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems