An efficient polynomial time approximation scheme for load balancing on uniformly related machines Leah EpsteinAsaf Levin Full Length Paper 27 August 2013 Pages: 1 - 23
A first order method for finding minimal norm-like solutions of convex optimization problems Amir BeckShoham Sabach Full Length Paper 30 August 2013 Pages: 25 - 46
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
Tree metrics and edge-disjoint \(S\)-paths Hiroshi HiraiGyula Pap Full Length Paper 18 October 2013 Pages: 81 - 123
Iterative hard thresholding methods for \(l_0\) regularized convex cone programming Zhaosong Lu Full Length Paper 26 September 2013 Pages: 125 - 154
On the bilinearity rank of a proper cone and Lyapunov-like transformations M. Seetharama GowdaJiyuan Tao Full Length Paper 28 September 2013 Pages: 155 - 170
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization V. JeyakumarG. Y. Li Full Length Paper 26 September 2013 Pages: 171 - 206
A simple randomised algorithm for convex optimisation M. DyerR. KannanL. Stougie Full Length Paper 13 October 2013 Pages: 207 - 229
Network congestion control with Markovian multipath routing Roberto CominettiCristóbal Guzmán Full Length Paper 10 December 2013 Pages: 231 - 251
The divergence of the BFGS and Gauss Newton methods Walter F. Mascarenhas Full Length Paper 24 November 2013 Pages: 253 - 276
Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming Zhaosong Lu Full Length Paper 06 November 2013 Pages: 277 - 307
The Hirsch Conjecture for the fractional stable set polytope Carla MichiniAntonio Sassano Full Length Paper 29 November 2013 Pages: 309 - 330
The numerical solution of Newton’s problem of least resistance Gerd Wachsmuth Full Length Paper 15 February 2014 Pages: 331 - 350
Computing the nearest Euclidean distance matrix with low embedding dimensions Hou-Duo QiXiaoming Yuan Full Length Paper 08 November 2013 Pages: 351 - 389
Threshold Boolean form for joint probabilistic constraints with random technology matrix Alexander KoganMiguel A. Lejeune Full Length Paper 01 December 2013 Pages: 391 - 427
Guaranteed clustering and biclustering via semidefinite programming Brendan P. W. Ames Full Length Paper 30 November 2013 Pages: 429 - 465
Optimality, identifiability, and sensitivity D. DrusvyatskiyA. S. Lewis Full Length Paper 29 November 2013 Pages: 467 - 498
On matching cover of graphs Xiumei WangXiaoxin SongJinjiang Yuan Full Length Paper 30 November 2013 Pages: 499 - 518
A Frank–Wolfe type theorem for nondegenerate polynomial programs Si Tiep DinhHuy Vui HaTien Son Pham Full Length Paper 08 December 2013 Pages: 519 - 538
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints Chao DingDefeng SunJane J. Ye Full Length Paper 28 December 2013 Pages: 539 - 579
Strongly regular nonsmooth generalized equations Alexey F. Izmailov Short Communication 26 September 2013 Pages: 581 - 590