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

DOI10.1007/S10898-008-9356-0zbMATH Open1180.90335OpenAlexW1995136572MaRDI QIDQ835795FDOQ835795

Authors: 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

Recommendations

• scientific article; zbMATH DE number 653034
• An interior point potential reduction algorithm for the linear complementarity problem
• Polynomial interior point algorithms for general linear complementarity problems
• Generalized Linear Complementarity Problems
• An Infeasible-Interior-Point Method for Linear Complementarity Problems

zbMATH Keywords

algorithmcondition numberextensioninterior point methodlinear complementarity problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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

Cited In (2)

• A modified potential reduction algorithm for linear complementarity problems
• Polynomial interior point algorithms for general linear complementarity problems

This page was built for publication: An extension of interior point potential reduction algorithm to solve general lcps

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