A Primal-Dual Accelerated Interior Point Method Whose Running Time Depends Only on A

We propose a primal-dual \layered-step" interior point (LIP) algorithm for linear programming with data given by real numbers. This algorithm follows the central path, either with short steps or with a new type of step called a \layered least squares" (LLS) step. The algorithm returns an exact optimum after a nite number of steps|in particular, after O(n 3:5 c(A)) iterations, where c(A) is a function of This paper represents a simpliication of an earlier manuscript \An accelerated interior point method whose running depends only on A" by the same authors.

[1]  J. Edmonds.  Systems of distinct representatives and linear algebra , 1967 .

[2]  M. H. Wright.  Numerical methods for nonlinearly constrained optimization , 1976 .

[3]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[4]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[5]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[6]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[7]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[8]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[9]  D. Bayer,et al.  The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .

[10]  G. Stewart.  On scaled projections and pseudoinverses , 1989 .

[11]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[12]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[13]  Nimrod Megiddo,et al.  Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..

[14]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[15]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[16]  J. Lagarias.  The nonlinear geometry of linear programming. III. Projective Legendre transform coordinates and Hilbert geometry , 1990 .

[17]  D. O’Leary.  On bounds for scaled projections and pseudoinverses , 1990 .

[18]  Michael J. Todd,et al.  A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm , 1990, Oper. Res..

[19]  Thomas F. Coleman,et al.  Large-Scale Numerical Optimization: Introduction and Overview , 1991 .

[20]  Josef Stoer,et al.  On the complexity of following the central path of linear programs by linear extrapolation II , 1991, Math. Program..

[21]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[22]  S. Vavasis.  Nonlinear optimization: complexity issues , 1991 .

[23]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

[24]  Yinyu Ye,et al.  On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..

[25]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..

[26]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[27]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[28]  Yinyu Ye,et al.  A Short-Cut Potential Reduction Algorithm for Linear Programming , 1993 .

[29]  Levent Tun,et al.  A Pseudo{polynomial Complexity Analysis for Interior{point Algorithms , 1993 .

[30]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[31]  Kaoru Tone,et al.  An active-set strategy in an interior point method for linear programming , 1991, Math. Program..

[32]  Shinji Mizuno,et al.  A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming , 1993 .

[33]  Yin Zhang,et al.  A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..

[34]  S. Vavasis.  Stable Numerical Algorithms for Equilibrium Systems , 1994, SIAM J. Matrix Anal. Appl..

[35]  Y. Ye,et al.  Condition numbers for polyhedra with real number data , 1995, Oper. Res. Lett..

[36]  Leonid Khachiyan,et al.  On the Complexity of Approximating Extremal Determinants in Matrices , 1995, J. Complex..

[37]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..