1. Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization

   • Jean Charles Gilbert

   OriginalPaper Pages: 1 - 28

2. Limiting behavior of the affine scaling continuous trajectories for linear programming problems

   • Ilan Adler
   • Renato D. C. Monteiro

   OriginalPaper Pages: 29 - 51

3. A network penalty method

   • A. B. Gamble
   • A. R. Conn
   • W. R. Pulleyblank

   OriginalPaper Pages: 53 - 73

4. Convergence of a generalized subgradient method for nondifferentiable convex optimization

   • Sehun Kim
   • Hyunsil Ahn

   OriginalPaper Pages: 75 - 80

5. On computing the center of a convex quadratically constrained set

   • Sanjay Mehrotra
   • Jie Sun

   OriginalPaper Pages: 81 - 89

6. Effort associated with a class of random optimization methods

   • Chang C. Y. Dorea

   OriginalPaper Pages: 91 - 98

7. Contingent derivatives of set-valued maps and applications to vector optimization

   • Dinh The Luc

   OriginalPaper Pages: 99 - 111

8. Solving (large scale) matching problems combinatorially

   • U. Derigs
   • A. Metz

   OriginalPaper Pages: 113 - 121

9. On the core of network synthesis games

   • A. Tamir

   OriginalPaper Pages: 123 - 135

10. Nominations for 1991 elections

    Notice Pages: 137 - 137

11. Announcement of the 16th Symposium on Operations Research

    Notice Pages: 139 - 139

12. The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients

    • Andreas Griewank

    OriginalPaper Pages: 141 - 175

13. Convergence of quasi-Newton matrices generated by the symmetric rank one update

    • A. R. Conn
    • N. I. M. Gould
    • Ph. L. Toint

    OriginalPaper Pages: 177 - 195

14. Distribution sensitivity in stochastic programming

    • Werner Römisch
    • Rüdiger Schultz

    OriginalPaper Pages: 197 - 226

15. Nonlinear programming and stationary equilibria in stochastic games

    • J. A. Filar
    • T. A. Schultz
    • O. J. Vrieze

    OriginalPaper Pages: 227 - 237

16. An O(n ³ L) potential reduction algorithm for linear programming

    • Yinyu Ye

    OriginalPaper Pages: 239 - 258

17. Concave minimization via conical partitions and polyhedral outer approximation

    • Reiner Horst
    • Nguyen V. Thoai
    • Harold P. Benson

    OriginalPaper Pages: 259 - 274

18. Call for papers

    Notice Pages: 275 - 275

19. Use of dynamic trees in a network simplex algorithm for the maximum flow problem

    • Andrew V. Goldberg
    • Michael D. Grigoriadis
    • Robert E. Tarjan

    OriginalPaper Pages: 277 - 290

20. Karmarkar's linear programming algorithm and Newton's method

    • D. A. Bayer
    • J. C. Lagarias

    OriginalPaper Pages: 291 - 330

21. An\(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems

    • Masakazu Kojima
    • Shinji Mizuno
    • Akiko Yoshise

    OriginalPaper Pages: 331 - 342

22. The primal-dual algorithm as a constraint-set-manipulation device

    • Arnold Lent
    • Yair Censor

    OriginalPaper Pages: 343 - 357

23. Finite termination of the proximal point algorithm

    • Michael C. Ferris

    OriginalPaper Pages: 359 - 366

24. Global optimization and simulated annealing

    • Anton Dekkers
    • Emile Aarts

    OriginalPaper Pages: 367 - 393

25. Correlation polytopes: Their geometry and complexity

    • Itamar Pitowsky

    OriginalPaper Pages: 395 - 414

26. Errata

    • I. Adler
    • N. Karmarkar
    • G. Veiga

    Notice Pages: 415 - 415

27. Announcement of the first biennial Italo-Soviet conference on methods and applications of mathematical programming

    Notice Pages: 417 - 417