From error bounds to the complexity of first-order descent methods for convex functions Jérôme BolteTrong Phong NguyenBruce W. Suter Full Length Paper 30 November 2016 Pages: 471 - 507
Polynomial root radius optimization with affine constraints Julia EatonSara GrundelMichael L. Overton Full Length Paper 23 November 2016 Pages: 509 - 528
An extended formulation of the convex recoloring problem on a tree Sunil ChopraBartosz FilipeckiMathieu Van Vyve Full Length Paper 30 November 2016 Pages: 529 - 548
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables Chen ChenAlper AtamtürkShmuel S. Oren Full Length Paper 10 December 2016 Pages: 549 - 577
Revisiting k-sum optimization J. PuertoA. M. Rodríguez-ChíaA. Tamir Full Length Paper 16 December 2016 Pages: 579 - 604
Probably certifiably correct k-means clustering Takayuki IguchiDustin G. MixonSoledad Villar Full Length Paper 21 December 2016 Pages: 605 - 642
The matching problem has no small symmetric SDP Gábor BraunJonah Brown-CohenDaniel Zink Full Length Paper 22 December 2016 Pages: 643 - 662
Hirsch polytopes with exponentially long combinatorial segments Jean-Philippe LabbéThibault MannevilleFrancisco Santos Full Length Paper 19 December 2016 Pages: 663 - 688
A unified approach to error bounds for structured convex optimization problems Zirui ZhouAnthony Man-Cho So Full Length Paper 25 January 2017 Pages: 689 - 728