Amenable cones: error bounds without constraint qualifications Bruno F. Lourenço Full Length Paper 07 November 2019 Pages: 1 - 48
Why random reshuffling beats stochastic gradient descent M. GürbüzbalabanA. OzdaglarP. A. Parrilo Full Length Paper 29 October 2019 Pages: 49 - 84
Hypergraph k-cut in randomized polynomial time Karthekeyan ChandrasekaranChao XuXilin Yu Full Length Paper 13 November 2019 Pages: 85 - 113
On distributionally robust chance constrained programs with Wasserstein distance Weijun Xie Full Length Paper 13 November 2019 Pages: 115 - 155
Implementable tensor methods in unconstrained convex optimization Yurii Nesterov Full Length Paper Open access 21 November 2019 Pages: 157 - 183
Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems Dan GarberAtara KaplanShoham Sabach Full Length Paper 29 November 2019 Pages: 185 - 208
Exploiting partial correlations in distributionally robust optimization Divya PadmanabhanKarthik NatarajanKarthyek Murthy Full Length Paper 02 December 2019 Pages: 209 - 255
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods Gabriel HaeserOliver HinderYinyu Ye Full Length Paper 21 December 2019 Pages: 257 - 288
The salesman’s improved tours for fundamental classes Sylvia BoydAndrás Sebő Full Length Paper 09 December 2019 Pages: 289 - 307
On sparsity of the solution to a random quadratic optimization problem Xin ChenBoris Pittel Full Length Paper 09 December 2019 Pages: 309 - 336
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem Pascale BendottiPierre FouilhouxCécile Rottner Full Length Paper 16 December 2019 Pages: 337 - 372
Stronger MIP formulations for the Steiner forest problem Daniel SchmidtBernd ZeyFrançois Margot Full Length Paper Open access 03 January 2020 Pages: 373 - 407
An \({\mathcal {O}}(n^2 \log {n})\) algorithm for the weighted stable set problem in claw-free graphs Paolo NobiliAntonio Sassano Full Length Paper 06 January 2020 Pages: 409 - 437
Near-optimal discrete optimization for experimental design: a regret minimization approach Zeyuan Allen-ZhuYuanzhi LiYining Wang Full Length Paper 10 January 2020 Pages: 439 - 478
Nonnegative rank depends on the field Yaroslav Shitov Short Communication 13 November 2019 Pages: 479 - 486