1. A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints

   • Thomas F. Coleman
   • Yuying Li

   Pages: 1 - 31

2. Facets with fixed defect of the stable set polytope

   • László Lipták
   • László Lovász

   Pages: 33 - 44

3. Existence of optimal solutions and duality results under weak conditions

   • A. Auslender

   Pages: 45 - 59

4. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions

   • Renato D.C. Monteiro
   • Takashi Tsuchiya

   Pages: 61 - 83

5. An ε-relaxation method for separable convex cost generalized network flow problems

   • Paul Tseng
   • Dimitri P. Bertsekas

   Pages: 85 - 104

6. Optimality conditions for nonconvex semidefinite programming

   • Anders Forsgren

   Pages: 105 - 128

7. Notes on L-/M-convex functions and the separation theorems

   • Satoru Fujishige
   • Kazuo Murota

   Pages: 129 - 146

8. A first order characterization of generalized monotonicity

   • Reinhard John

   Pages: 147 - 155

9. On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating

   • J.V. Burke
   • Maijian Qian

   Pages: 157 - 181

10. Co-NP-completeness of some matrix classification problems

    • Paul Tseng

    Pages: 183 - 192

11. Change of generalized indices of stationary solutions. to multiparametric optimization

    • Masayuki Shida

    Pages: 193 - 210

12. A penalized Fischer-Burmeister NCP-function

    • Bintong Chen
    • Xiaojun Chen
    • Christian Kanzow

    Short Communication Pages: 211 - 216

13. A note on Faigle and Kern’s dual greedy polyhedra

    • Satoru Fujishige

    Short Communication Pages: 217 - 220