An extension of interior point potential reduction algorithm to solve general lcps

DOI10.1007/s10898-008-9356-0zbMath1180.90335OpenAlexW1995136572MaRDI QIDQ835795

Laura Di Giacomo

Publication date: 31 August 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9356-0

zbMATH Keywords

algorithmlinear complementarity problemcondition numberinterior point methodextension

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• A class of linear complementarity problems solvable in polynomial time
• On affine scaling algorithms for nonconvex quadratic programming
• Linear Complementarity as a General Solution Method to Combinatorial Problems