1. A cutting plane algorithm for convex programming that uses analytic centers

   • David S. Atkinson
   • Pravin M. Vaidya

   OriginalPaper Pages: 1 - 43

2. A cutting plane method from analytic centers for stochastic programming

   • O. Bahn
   • O. du Merle
   • J. -P. Vial

   OriginalPaper Pages: 45 - 73

3. A sufficient condition for self-concordance, with application to some classes of structured convex programming problems

   • D. den Hertog
   • F. Jarre
   • T. Terlaky

   OriginalPaper Pages: 75 - 88

4. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities

   • Krzysztof C. Kiwiel

   OriginalPaper Pages: 89 - 109

5. New variants of bundle methods

   • Claude Lemaréchal
   • Arkadii Nemirovskii
   • Yurii Nesterov

   OriginalPaper Pages: 111 - 147

6. Complexity estimates of some cutting plane methods based on the analytic barrier

   • Yu. Nesterov

   OriginalPaper Pages: 149 - 176

7. An interior-point method for generalized linear-fractional programming

   • Yu. E. Nesterov
   • A. S. Nemirovskii

   OriginalPaper Pages: 177 - 204

8. A primal—dual potential reduction method for problems involving matrix inequalities

   • Lieven Vandenberghe
   • Stephen Boyd

   OriginalPaper Pages: 205 - 236

9. A continuation method for monotone variational inequalities

   • Bintong Chen
   • Patrick T. Harker

   OriginalPaper Pages: 237 - 253

10. Nonlinear mappings associated with the generalized linear complementarity problem

    • Aniekan Ebiefung

    OriginalPaper Pages: 255 - 268

11. About strongly polynomial time algorithms for quadratic optimization over submodular constraints

    • Dorit S. Hochbaum
    • Sung-Pil Hong

    OriginalPaper Pages: 269 - 309

12. Superlinear primal-dual affine scaling algorithms for LCP

    • R. D. C. Monteiro
    • S. J. Wright

    OriginalPaper Pages: 311 - 333

13. Worst-case comparison of valid inequalities for the TSP

    • Michel X. Goemans

    OriginalPaper Pages: 335 - 349

14. Referees 1994

    Notice Pages: 351 - 353

15. A quadratically convergent\(O((\kappa + 1)\sqrt n L)\)-iteration algorithm for theP _*(κ)-matrix linear complementarity problem

    • Jianming Miao

    OriginalPaper Pages: 355 - 368

16. An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

    • Sridhar R. Tayur
    • Rekha R. Thomas
    • N. R. Natraj

    OriginalPaper Pages: 369 - 401

17. Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

    • Jia-Ming Cao

    OriginalPaper Pages: 403 - 411

18. Dual decomposition of a single-machine scheduling problem

    • S. L. van de Velde

    OriginalPaper Pages: 413 - 428

19. The complexity of approximating a nonlinear program

    • Mihir Bellare
    • Phillip Rogaway

    OriginalPaper Pages: 429 - 441

20. Pure adaptive search for finite global optimization

    • Z. B. Zabinsky
    • G. R. Wood
    • W. P. Baritompa

    OriginalPaper Pages: 443 - 448

21. New algorithms for lineark-matroid intersection and matroidk-parity problems

    • Alexander I. Barvinok

    OriginalPaper Pages: 449 - 470

22. On games corresponding to sequencing situations with ready times

    • Herbert Hamers
    • Peter Borm
    • Stef Tijs

    OriginalPaper Pages: 471 - 483

23. Foreword

    • Jean-Louis Goffin
    • Jean-Philippe Vial

    OriginalPaper Pages: vii - ix