1. On the Behavior of the Gradient Norm in the Steepest Descent Method

   • Jorge Nocedal
   • Annick Sartenaer
   • Ciyou Zhu

   OriginalPaper Pages: 5 - 35

2. A Frank–Wolfe Type Theorem for Convex Polynomial Programs

   • Evgeny G. Belousov
   • Diethard Klatte

   OriginalPaper Pages: 37 - 48

3. Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation

   • Samuel Burer
   • Renato D.C. Monteiro
   • Yin Zhang

   OriginalPaper Pages: 49 - 79

4. A Globally Convergent Smoothing Newton Method for Nonsmooth Equations and Its Application to Complementarity Problems

   • Kouichi Taji
   • Motohiro Miyamoto

   OriginalPaper Pages: 81 - 101

5. Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization

   • Yuhong Dai
   • Jinyun Yuan
   • Ya-Xiang Yuan

   OriginalPaper Pages: 103 - 109

6. Parallel Variable Distribution for Constrained Optimization

   • C.A. Sagastizábal
   • M.V. Solodov

   OriginalPaper Pages: 111 - 131

7. Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search

   • Larry Nazareth
   • Paul Tseng

   OriginalPaper Pages: 133 - 144