| 635 | -- | 659 | Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter. Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming |
| 660 | -- | 674 | Uwe Naumann. Cheaper Jacobians by Simulated Annealing |
| 675 | -- | 692 | X. X. Huang, X. Q. Yang. Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization |
| 693 | -- | 701 | Yu-Hong Dai. Convergence Properties of the BFGS Algoritm |
| 702 | -- | 725 | A. S. Lewis. Active Sets, Nonsmoothness, and Sensitivity |
| 726 | -- | 744 | Chong Li, K. F. Ng. On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces |
| 745 | -- | 765 | Roberto Cominetti, Matias Courdurier. Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm |
| 766 | -- | 782 | Y. Q. Bai, Mohamed El Ghami, Cees Roos. A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier |
| 783 | -- | 804 | Michael C. Ferris, Todd S. Munson. Interior-Point Methods for Massive Support Vector Machines |
| 805 | -- | 841 | Michael Ulbrich. Semismooth Newton Methods for Operator Equations in Function Spaces |
| 842 | -- | 864 | Jacek Gondzio, Andreas Grothey. Reoptimization With the Primal-Dual Interior Point Method |
| 865 | -- | 888 | Michael Hintermüller, K. Ito, Karl Kunisch. The Primal-Dual Active Set Strategy as a Semismooth Newton Method |
| 889 | -- | 903 | Charles Audet, J. E. Dennis Jr.. Analysis of Generalized Pattern Searches |
| 904 | -- | 920 | V. Jeyakumar, D. T. Luc. Sharp Variational Conditions for Convex Composite Nonsmooth Functions |
| 921 | -- | 937 | Michael C. Ferris, Jinho Lim, David M. Shepard. An Optimization Approach for Radiosurgery Treatment Planning |
| 938 | -- | 945 | Shoji Kamimura, Wataru Takahashi. Strong Convergence of a Proximal-Type Algorithm in a Banach Space |