On the convergence analysis of arc search interior point methods for LCPs

DOI10.1007/s13370-019-00697-wzbMath1438.90232OpenAlexW2946290855WikidataQ127865481 ScholiaQ127865481MaRDI QIDQ2337791

Yanyan Li

Publication date: 20 November 2019

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-019-00697-w

zbMATH Keywords

convergence analysisinterior-point methodlinear complementarity problemellipsoidal approximation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial arc-search interior-point algorithm for linear programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• A new polynomial-time algorithm for linear programming
• Polynomial time second order mehrotra-type predictor--corrector algorithms
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A unified approach to interior point algorithms for linear complementary problems
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• On the Implementation of a Primal-Dual Interior Point Method
• High-order predictor-corrector algorithms
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming