1. Introduction

   • Kurt M. Anstreicher

   EditorialNotes Pages: 1 - 2

2. Potential-reduction methods in mathematical programming

   • Michael J. Todd

   OriginalPaper Pages: 3 - 45

3. Long-step strategies in interior-point primal-dual methods

   • Yu. Nesterov

   OriginalPaper Pages: 47 - 94

4. Fast convergence of the simplified largest step path following algorithm

   • Clovis C. Gonzaga
   • J. Frédéric Bonnans

   OriginalPaper Pages: 95 - 115

5. Improved complexity using higher-order correctors for primal-dual Dikin affine scaling

   • B. Jansen
   • C. Roos
   • Y. Ye

   OriginalPaper Pages: 117 - 130

6. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

   • J. -L. Goffin
   • J. Gondzio
   • J. -P. Vial

   OriginalPaper Pages: 131 - 154

7. An infeasible interior-point algorithm for solving primal and dual geometric programs

   • K. O. Kortanek
   • Xiaojie Xu
   • Yinyu Ye

   OriginalPaper Pages: 155 - 181

8. A QMR-based interior-point algorithm for solving linear programs

   • Roland W. Freund
   • Florian Jarre

   OriginalPaper Pages: 183 - 210

9. On homogeneous and self-dual algorithms for LCP

   • Yinyu Ye

   OriginalPaper Pages: 211 - 221

10. Predictor-corrector algorithm for solvingP _*(κ)-matrix LCP from arbitrary positive starting points

    • Florian A. Potra
    • Rongqin Sheng

    OriginalPaper Pages: 223 - 244

11. Volumetric path following algorithms for linear programming

    • Kurt M. Anstreicher

    OriginalPaper Pages: 245 - 263