The steepest descent barrier-projective method for linear complementarity problems

MaRDI QIDQ5291088zbMATH OpenFDO

Authors

Publication date 9 May 2006

zbMATH Keywords

algorithmbarrier-projective methodlinear complementarity problemssteepest descent

Mathematics Subject Classification ID

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

Recommendations

• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Projective algorithms for solving complementarity problems
• A linearization method for generalized complementarity problems
• scientific article; zbMATH DE number 4183197
• A rapid algorithm for a class of linear complementarity problems

Cited in

(1)

• Barrier-projective methods for nonlinear programming

This page was built for publication: The steepest descent barrier-projective method for linear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5291088)