Improved infeasible-interior-point algorithm for linear complementarity problerns

MaRDI QIDQ2445079zbMATH OpenFDO

Authors Yanyan Li

Publication date 11 April 2014

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

interior-point methodspolynomial complexitysearch directionsfull-Newton steps

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cited in

(5)

• An adaptive infeasible interior-point algorithm for linear complementarity problems
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A polynomial interior-point algorithm for monotone linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems

This page was built for publication: Improved infeasible-interior-point algorithm for linear complementarity problerns

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