论文信息 - A path-following version of the Todd-Burrell procedure for linear programming

A path-following version of the Todd-Burrell procedure for linear programming

We propose a path-following version of the Todd-Burrell procedure to solve linear programming problems with an unknown optimal value. The path-following scheme is not restricted to Karmarkar's primal step; it can also be implemented with a dual Newton step or with a primal-dual step.

Jean-Philippe Vial | J. Vial

[1] J. Vial. A Generic Path-Following Algorithm with a Sliding Constraint and its Application to Linear Programming and the Computation of Analytic Centers , 1996 .

[2] Jean-Philippe Vial. A unified approach to projective algorithms for linear programming , 1988 .

[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[4] Jean-Philippe Vial,et al. Short Steps with Karmarkar's Projective Algorithm for Linear Programming , 1994, SIAM J. Optim..

[5] Kees Roos,et al. A survey of search directions in interior point methods for linear programming , 1991, Math. Program..

[6] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .

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

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

[9] Dong X. Shaw,et al. A Path-Following Projective Interior Point Method for Linear Programming , 1994, SIAM J. Optim..