Tight relaxations for polynomial optimization and Lagrange multiplier expressions Jiawang Nie Full Length Paper 18 April 2018 Pages: 1 - 37
Optimization problems involving group sparsity terms Amir BeckNadav Hallak Full Length Paper 25 April 2018 Pages: 39 - 67
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming Hongcheng LiuXue WangYinyu Ye Full Length Paper 03 May 2018 Pages: 69 - 108
An inexact dual logarithmic barrier method for solving sparse semidefinite programs Stefania BellaviaJacek GondzioMargherita Porcelli Full Length Paper 28 April 2018 Pages: 109 - 143
Generalized self-concordant functions: a recipe for Newton-type methods Tianxiao SunQuoc Tran-Dinh Full Length Paper 08 May 2018 Pages: 145 - 213
Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods Huikang LiuAnthony Man-Cho SoWeijie Wu Full Length Paper 01 June 2018 Pages: 215 - 262
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary Gabriel HaeserHongcheng LiuYinyu Ye Full Length Paper 14 May 2018 Pages: 263 - 299
A general double-proximal gradient algorithm for d.c. programming Sebastian BanertRadu Ioan Boț Full Length Paper Open access 23 May 2018 Pages: 301 - 326
Oracle complexity of second-order methods for smooth convex optimization Yossi ArjevaniOhad ShamirRon Shiff Full Length Paper 28 May 2018 Pages: 327 - 360
“Facet” separation with one linear program Michele ConfortiLaurence A. Wolsey Full Length Paper 28 May 2018 Pages: 361 - 380
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming Ying CuiDefeng SunKim-Chuan Toh Full Length Paper 22 May 2018 Pages: 381 - 415
On cutting planes for cardinality-constrained linear programs Jinhak KimMohit TawarmalaniJean-Philippe P. Richard Full Length Paper 06 June 2018 Pages: 417 - 448
A decomposition method for MINLPs with Lipschitz continuous nonlinearities Martin SchmidtMathias SirventWinnifried Wollner Full Length Paper 23 June 2018 Pages: 449 - 483
Submodular optimization views on the random assignment problem Satoru FujishigeYoshio SanoPing Zhan Full Length Paper 21 June 2018 Pages: 485 - 501
Efficiency of minimizing compositions of convex functions and smooth maps D. DrusvyatskiyC. Paquette Full Length Paper 20 July 2018 Pages: 503 - 558