1. Error bounds for analytic systems and their applications

   • Zhi-Quan Luo
   • Jong-Shi Pang

   OriginalPaper Pages: 1 - 28

2. An infeasible-interior-point algorithm for linear complementarity problems

   • Stephen J. Wright

   OriginalPaper Pages: 29 - 51

3. Solving large-scale minimax problems with the primal—dual steepest descent algorithm

   • Ciyou Zhu

   OriginalPaper Pages: 53 - 76

4. A saddle-point characterization of Pareto optima

   • M. van Rooyen
   • X. Zhou
   • S. Zlobec

   OriginalPaper Pages: 77 - 88

5. A note on exploiting structure when using slack variables

   • A. R. Conn
   • Nick Gould
   • Ph. L. Toint

   OriginalPaper Pages: 89 - 97

6. Quantitative stability in stochastic programming

   • Alexander Shapiro

   OriginalPaper Pages: 99 - 108

7. Polynomiality of infeasible-interior-point algorithms for linear programming

   • Shinji Mizuno

   OriginalPaper Pages: 109 - 119

8. On thek-cut subgraph polytope

   • Kalyan T. Talluri
   • Donald K. Wagner

   OriginalPaper Pages: 121 - 132

9. Optimal objective function approximation for separable convex quadratic programming

   • F. Güder
   • J. G. Morris

   OriginalPaper Pages: 133 - 142

10. Finite master programs in regularized stochastic decomposition

    • Julia L. Higle
    • Suvrajeet Sen

    OriginalPaper Pages: 143 - 168

11. Asymptotic analysis of the exponential penalty trajectory in linear programming

    • R. Cominetti
    • J. San Martín

    OriginalPaper Pages: 169 - 187

12. On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds

    • Thomas F. Coleman
    • Yuying Li

    OriginalPaper Pages: 189 - 224

13. Optimality conditions in mathematical programming and composite optimization

    • Jean-Paul Penot

    OriginalPaper Pages: 225 - 245

14. A trust region algorithm for nonsmooth optimization

    • T. Bannert

    OriginalPaper Pages: 247 - 264

15. Some properties of the Hessian of the logarithmic barrier function

    • Margaret H. Wright

    OriginalPaper Pages: 265 - 295

16. Polyhedra for lot-sizing with Wagner—Whitin costs

    • Yves Pochet
    • Laurence A. Wolsey

    OriginalPaper Pages: 297 - 323

17. Implementing an efficient minimum capacity cut algorithm

    • Hiroshi Nagamochi
    • Tadashi Ono
    • Toshihide Ibaraki

    OriginalPaper Pages: 325 - 341

18. Bounded knapsack sharing

    • J. Randall Brown

    OriginalPaper Pages: 343 - 382

19. A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points

    • Florian A. Potra

    OriginalPaper Pages: 383 - 406

20. An interior-point method for fractional programs with convex constraints

    • Roland W. Freund
    • Florian Jarre

    OriginalPaper Pages: 407 - 440