Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming

DOI10.1137/S105262349325771XzbMath0856.90075OpenAlexW1996314042MaRDI QIDQ4895610

Jian-Ming Miao

Publication date: 23 February 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s105262349325771x

zbMATH Keywords

Newton directionEuler directioninfeasible interior-point predictor-corrector algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence, A polynomial arc-search interior-point algorithm for linear programming, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, Two new predictor-corrector algorithms for second-order cone programming, A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems