1. Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems

   • Abderrahim Jourani

   OriginalPaper Pages: 1 - 23

2. A trust region algorithm for minimization of locally Lipschitzian functions

   • Liqun Qi
   • Jie Sun

   OriginalPaper Pages: 25 - 43

3. Modifying the BFGS update by a new column scaling technique

   • Dirk Siegel

   OriginalPaper Pages: 45 - 78

4. Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

   • Deepankar Medhi

   OriginalPaper Pages: 79 - 101

5. The maximum entropy method on the mean: Applications to linear programming and superresolution

   • F. Gamboa
   • E. Gassiat

   OriginalPaper Pages: 103 - 122

6. Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming

   • Irvin J. Lustig
   • Roy E. Marsten
   • David F. Shanno

   OriginalPaper Pages: 123 - 135

7. A new method for a class of linear variational inequalities

   • Bingsheng He

   OriginalPaper Pages: 137 - 144

8. Constant potential primal—dual algorithms: A framework

   • Levent Tunçel

   OriginalPaper Pages: 145 - 159

9. Reduction of quasidifferentials and minimal representations

   • D. Pallaschke
   • R. Urbański

   OriginalPaper Pages: 161 - 180

10. Lattice basis reduction: Improved practical algorithms and solving subset sum problems

    • C. P. Schnorr
    • M. Euchner

    OriginalPaper Pages: 181 - 199

11. A distance constrainedp-facility location problem on the real line

    • Arie Tamir

    OriginalPaper Pages: 201 - 204

12. A bound-improving approach to discrete programming problems

    • P. Barcia
    • J. D. Coelho

    OriginalPaper Pages: 205 - 209

13. A computational study of graph partitioning

    • Julie Falkner
    • Franz Rendl
    • Henry Wolkowicz

    OriginalPaper Pages: 211 - 239

14. New improved error bounds for the linear complementarity problem

    • O. L. Mangasarian
    • J. Ren

    OriginalPaper Pages: 241 - 255

15. Characterizing consistency in probabilistic logic for a class of Horn clauses

    • K. A. Andersen

    OriginalPaper Pages: 257 - 271

16. The complex of maximal lattice free simplices

    • Imre Bárány
    • Roger Howe
    • Herbert E. Scarf

    OriginalPaper Pages: 273 - 281

17. A projection method forl _p norm location-allocation problems

    • Ingrid Bongartz
    • Paul H. Calamai
    • Andrew R. Conn

    OriginalPaper Pages: 283 - 312

18. Minimum cost multiflows in undirected networks

    • A. V. Karzanov

    OriginalPaper Pages: 313 - 325

19. Solving mixed integer nonlinear programs by outer approximation

    • Roger Fletcher
    • Sven Leyffer

    OriginalPaper Pages: 327 - 349

20. Stability for linearly constrained optimization problems

    • R. Hirabayashi
    • H. Th. Jongen
    • M. Shida

    OriginalPaper Pages: 351 - 360

21. Superlinear convergence of infeasible-interior-point methods for linear programming

    • Yin Zhang
    • Detong Zhang

    OriginalPaper Pages: 361 - 377

22. Second-order necessary and sufficient conditions in nonsmooth optimization

    • L. R. Huang
    • K. F. Ng

    OriginalPaper Pages: 379 - 402

23. Matroids and a forest cover problem

    • J. Orestes Cerdeira

    OriginalPaper Pages: 403 - 405