A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

DOI10.1137/0803006zbMath0781.90067OpenAlexW2080937142MaRDI QIDQ4697311

Richard A. Tapia, Yin Zhang

Publication date: 29 June 1993

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

Full work available at URL: http://hdl.handle.net/1911/101704

zbMATH Keywords

primal-dual interior-point algorithmspolynomialitycentering parametersuperlinear or quadratic convergencestep-length parameter

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Superlinear convergence of infeasible-interior-point methods for linear programming, A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming, Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence, A primal-dual interior-point method for linear programming based on a weighted barrier function, Interior-point methods for nonlinear complementarity problems, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, On the convergence of primal-dual interior-point methods with wide neighborhoods, On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP