1. An efficient polynomial time approximation scheme for load balancing on uniformly related machines

   • Leah Epstein
   • Asaf Levin

   Full Length Paper 27 August 2013 Pages: 1 - 23

2. A first order method for finding minimal norm-like solutions of convex optimization problems

   • Amir Beck
   • Shoham Sabach

   Full Length Paper 30 August 2013 Pages: 25 - 46

   

3. Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization

   • Jorge R. Vera

   Full Length Paper 25 September 2013 Pages: 47 - 79

   

4. Tree metrics and edge-disjoint \(S\)-paths

   • Hiroshi Hirai
   • Gyula Pap

   Full Length Paper 18 October 2013 Pages: 81 - 123

   

5. Iterative hard thresholding methods for \(l_0\) regularized convex cone programming

   • Zhaosong Lu

   Full Length Paper 26 September 2013 Pages: 125 - 154

6. On the bilinearity rank of a proper cone and Lyapunov-like transformations

   • M. Seetharama Gowda
   • Jiyuan Tao

   Full Length Paper 28 September 2013 Pages: 155 - 170

7. Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

   • V. Jeyakumar
   • G. Y. Li

   Full Length Paper 26 September 2013 Pages: 171 - 206

8. A simple randomised algorithm for convex optimisation

   • M. Dyer
   • R. Kannan
   • L. Stougie

   Full Length Paper 13 October 2013 Pages: 207 - 229

   

9. Network congestion control with Markovian multipath routing

   • Roberto Cominetti
   • Cristóbal Guzmán

   Full Length Paper 10 December 2013 Pages: 231 - 251

   

10. The divergence of the BFGS and Gauss Newton methods

    • Walter F. Mascarenhas

    Full Length Paper 24 November 2013 Pages: 253 - 276

    

11. Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming

    • Zhaosong Lu

    Full Length Paper 06 November 2013 Pages: 277 - 307

12. The Hirsch Conjecture for the fractional stable set polytope

    • Carla Michini
    • Antonio Sassano

    Full Length Paper 29 November 2013 Pages: 309 - 330

    

13. The numerical solution of Newton’s problem of least resistance

    • Gerd Wachsmuth

    Full Length Paper 15 February 2014 Pages: 331 - 350

    

14. Computing the nearest Euclidean distance matrix with low embedding dimensions

    • Hou-Duo Qi
    • Xiaoming Yuan

    Full Length Paper 08 November 2013 Pages: 351 - 389

    

15. Threshold Boolean form for joint probabilistic constraints with random technology matrix

    • Alexander Kogan
    • Miguel A. Lejeune

    Full Length Paper 01 December 2013 Pages: 391 - 427

    

16. Guaranteed clustering and biclustering via semidefinite programming

    • Brendan P. W. Ames

    Full Length Paper 30 November 2013 Pages: 429 - 465

    

17. Optimality, identifiability, and sensitivity

    • D. Drusvyatskiy
    • A. S. Lewis

    Full Length Paper 29 November 2013 Pages: 467 - 498

18. On matching cover of graphs

    • Xiumei Wang
    • Xiaoxin Song
    • Jinjiang Yuan

    Full Length Paper 30 November 2013 Pages: 499 - 518

    

19. A Frank–Wolfe type theorem for nondegenerate polynomial programs

    • Si Tiep Dinh
    • Huy Vui Ha
    • Tien Son Pham

    Full Length Paper 08 December 2013 Pages: 519 - 538

20. First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

    • Chao Ding
    • Defeng Sun
    • Jane J. Ye

    Full Length Paper 28 December 2013 Pages: 539 - 579

21. Strongly regular nonsmooth generalized equations

    • Alexey F. Izmailov

    Short Communication 26 September 2013 Pages: 581 - 590