On the Complexity of a Linear Programming Predictor-Corrector Algorithm Using the Two Norm Neighborhood
- 1 January 2022
- book chapter
- Published by Springer Nature
- p. 533-545
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On Mehrotra-Type Predictor-Corrector AlgorithmsSIAM Journal on Optimization, 2008
- Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming ProblemsSIAM Journal on Optimization, 2000
- On polynomiality of the Mehrotra-type predictor—corrector interior-point algorithmsMathematical Programming, 1995
- Polynomiality of infeasible-interior-point algorithms for linear programmingMathematical Programming, 1994
- A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting pointsMathematical Programming, 1994
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity ProblemSIAM Journal on Optimization, 1994
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming AlgorithmsSIAM Journal on Optimization, 1992
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984