The arc-search interior-point algorithm

DOI10.13413/J.CNKI.JDXBLXB.2014.04.10MaRDI QIDQ5498112zbMATH OpenFDO

Authors Ximei Yang, Hongwei Liu, Changhe Liu

Publication date 11 February 2015

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2014.04.10

zbMATH Keywords

arc-searchinterior-point algorithmlinear programmingpolynomial complexitywide neighborhood

Mathematics Subject Classification ID

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

Recommendations

• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming

Cited in

(9)

• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones
• Arc-search techniques for interior-point methods
• An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems

This page was built for publication: The arc-search interior-point algorithm

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