1. Efficient algorithms for robust and stable principal component pursuit problems

   • Necdet Serhat Aybat
   • Donald Goldfarb
   • Shiqian Ma

   OriginalPaper 12 November 2013 Pages: 1 - 29

   

2. Approximate dynamic programming for stochastic N-stage optimization with application to optimal consumption under uncertainty

   • Mauro Gaggero
   • Giorgio Gnecco
   • Marcello Sanguineti

   OriginalPaper 19 November 2013 Pages: 31 - 85

   

3. On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems

   • Zdeněk Dostál
   • David Horák
   • Petr Vodstrčil

   OriginalPaper 10 October 2013 Pages: 87 - 103

   

4. Properties and methods for finding the best rank-one approximation to higher-order tensors

   • Yuning Yang
   • Qingzhi Yang
   • Liqun Qi

   OriginalPaper 05 November 2013 Pages: 105 - 132

   

5. Semidefinite relaxations for semi-infinite polynomial programming

   • Li Wang
   • Feng Guo

   OriginalPaper 17 October 2013 Pages: 133 - 159

   

6. Strategic oscillation for the quadratic multiple knapsack problem

   • Carlos García-Martínez
   • Fred Glover
   • Rafael Martí

   OriginalPaper 28 November 2013 Pages: 161 - 185

   

7. A tabu search approach for proportionate multiprocessor open shop scheduling

   • Tamer F. Abdelmaguid
   • Mohamed A. Shalaby
   • Mohamed A. Awwad

   OriginalPaper 27 November 2013 Pages: 187 - 203

   

8. Graph partitions for the multidimensional assignment problem

   • Chrysafis Vogiatzis
   • Eduardo L. Pasiliao
   • Panos M. Pardalos

   OriginalPaper 08 November 2013 Pages: 205 - 224

   

9. Local convergence of quasi-Newton methods under metric regularity

   • F. J. Aragón Artacho
   • A. Belyakov
   • M. López

   OriginalPaper 30 October 2013 Pages: 225 - 247

   

10. Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions

    • Bryan Gardiner
    • Khan Jakee
    • Yves Lucet

    OriginalPaper 03 December 2013 Pages: 249 - 272