1. Conjugacy in quasi-convex programming

   • U. Passy
   • E. Z. Prisman

   OriginalPaper Pages: 121 - 146

2. Variable metric relaxation methods, part II: The ellipsoid method

   • Jean-Louis Goffin

   OriginalPaper Pages: 147 - 162

3. A descent algorithm for nonsmooth convex optimization

   • Masao Fukushima

   OriginalPaper Pages: 163 - 175

4. A weighted gram-schmidt method for convex quadratic programming

   • Philip E. Gill
   • Nicholas I. M. Gould
   • Margaret H. Wright

   OriginalPaper Pages: 176 - 195

5. Efficiency and implementation of simplicial zero point algorithms

   • G. van der Laan
   • L. P. Seelen

   OriginalPaper Pages: 196 - 217

6. Convergence of the cyclical relaxation method for linear inequalities

   • Jan Mandel

   OriginalPaper Pages: 218 - 228

7. Adjacency on polymatroids

   • Donald M. Topkis

   OriginalPaper Pages: 229 - 237

8. A note on limiting infisup theorems

   • J. -C. Pomerol

   Short Communication Pages: 238 - 241