1. Preface

   • Kurt M. Anstreicher
   • Robert M. Freund

   EditorialNotes Pages: IX - XI

2. Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs

   • Masakazu Kojima

   OriginalPaper Pages: 1 - 28

3. An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

   • Robert M. Freund

   OriginalPaper Pages: 29 - 57

4. An infeasible-interior-point algorithm using projections onto a convex set

   • Shinji Mizuno
   • Florian Jarre

   OriginalPaper Pages: 59 - 80

5. AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence

   • Florian A. Potra

   OriginalPaper Pages: 81 - 102

6. A path-following interior-point algorithm for linear and quadratic problems

   • Stephen J. Wright

   OriginalPaper Pages: 103 - 130

7. A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence

   • Detong Zhang
   • Yin Zhang

   OriginalPaper Pages: 131 - 150

8. A simplified homogeneous and self-dual linear programming algorithm and its implementation

   • Xiaojie Xu
   • Pi-Fang Hung
   • Yinyu Ye

   OriginalPaper Pages: 151 - 171

9. A relaxed primal-dual path-following algorithm for linear programming

   • Tsung-Min Hwang
   • Chih-Hung Lin
   • Shu-Cherng Fang

   OriginalPaper Pages: 173 - 196

10. Primal-dual target-following algorithms for linear programming

    • B. Jansen
    • C. Roos
    • J. -Ph. Vial

    OriginalPaper Pages: 197 - 231

11. A lower bound on the number of iterations of long-step primal-dual linear programming algorithms

    • Michael J. Todd
    • Yinyu Ye

    OriginalPaper Pages: 233 - 252

12. Solving real-world linear ordering problems using a primal-dual interior point cutting plane method

    • John E. Mitchell
    • Brian Borchers

    OriginalPaper Pages: 253 - 276

13. An interior-point method for semi-infinite programming problems

    • Ulrich Schättler

    OriginalPaper Pages: 277 - 301

14. A simple proof of a primal affine scaling method

    • Romesh Saigal

    OriginalPaper Pages: 303 - 324

15. An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption

    • Masakazu Muramatsu
    • Takashi Tsuchiya

    OriginalPaper Pages: 325 - 355

16. A convergence analysis for a convex version of Dikin's algorithm

    • Jie Sun

    OriginalPaper Pages: 357 - 374

17. The primal power affine scaling method

    • Romesh Saigal

    OriginalPaper Pages: 375 - 417

18. An interior point method for general large-scale quadratic programming problems

    • Pault T. Boggs
    • Paul D. Domich
    • Janet E. Rogers

    OriginalPaper Pages: 419 - 437

19. Computational experience with penalty-barrier methods for nonlinear programming

    • Marc G. Breitfeld
    • David F. Shanno

    OriginalPaper Pages: 439 - 463

20. The Newton modified barrier method for QP problems

    • A. Melman
    • R. Polyak

    OriginalPaper Pages: 465 - 519

21. Large step volumetric potential reduction algorithms for linear programming

    • Kurt M. Anstreicher

    OriginalPaper Pages: 521 - 538

22. New complexity results for the Iri-Imai method

    • Jos F. Sturm
    • Shuzhong Zhang

    OriginalPaper Pages: 539 - 564

23. Identifying an optimal basis in linear programming

    • Stephen A. Vavasis
    • Yinyu Ye

    OriginalPaper Pages: 565 - 572