- Jean Charles Gilbert: Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. 1-28 BibTeX
- Ilan Adler, Renato D. C. Monteiro: Limiting behavior of the affine scaling continuous trajectories for linear programming problems. 29-51 BibTeX
- A. B. Gamble, Andrew R. Conn, William R. Pulleyblank: A network penalty method. 53-73 BibTeX
- Sehun Kim, Hyunsil Ahn: Convergence of a generalized subgradient method for nondifferentiable convex optimization. 75-80 BibTeX
- Sanjay Mehrotra, Jie Sun: On computing the center of a convex quadratically constrained set. 81-89 BibTeX
- Chang C. Y. Dorea: Effort associated with a class of random optimization methods. 91-98 BibTeX
- Dinh The Luc: Contingent derivatives of set-valued maps and applications to vector optimization. 99-111 BibTeX
- Ulrich Derigs, A. Metz: Solving (large scale) matching problems combinatorially. 113-121 BibTeX
- Arie Tamir: On the core of network synthesis games. 123-135 BibTeX
- Andreas Griewank: The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients. 141-175 BibTeX
- Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint: Convergence of quasi-Newton matrices generated by the symmetric rank one update. 177-195 BibTeX
- Werner Römisch, Rüdiger Schultz: Distribution sensitivity in stochastic programming. 197-226 BibTeX
- Jerzy A. Filar, T. A. Schultz, Frank Thuijsman, O. J. Vrieze: Nonlinear programming and stationary equilibria in stochastic games. 227-237 BibTeX
- Yinyu Ye:
An O(n
^{3}L) potential reduction algorithm for linear programming. 239-258 BibTeX - Reiner Horst, Nguyen V. Thoai, Harold P. Benson: Concave minimization via conical partitions and polyhedral outer approximation. 259-274 BibTeX
- Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan: Use of dynamic trees in a network simplex algorithm for the maximum flow problem. 277-290 BibTeX
- D. A. Bayer, Jeffrey C. Lagarias: Karmarkar's linear programming algorithm and Newton's method. 291-330 BibTeX
- Masakazu Kojima, Shinji Mizuno, Akiko Yoshise: An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. 331-342 BibTeX
- Arnold Lent, Yair Censor: The primal-dual algorithm as a constraint-set-manipulation device. 343-357 BibTeX
- Michael C. Ferris: Finite termination of the proximal point algorithm. 359-366 BibTeX
- Anton Dekkers, Emile H. L. Aarts: Global optimization and simulated annealing. 367-393 BibTeX
- Itamar Pitowsky: Correlation polytopes: Their geometry and complexity. 395-414 BibTeX