A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (1) , 118-133
- https://doi.org/10.1137/0803006
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming AlgorithmsSIAM Journal on Optimization, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- Further Development of a Primal-Dual Interior Point MethodINFORMS Journal on Computing, 1990
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986