| 1 | -- | 37 | Jiawang Nie. Tight relaxations for polynomial optimization and Lagrange multiplier expressions |
| 39 | -- | 67 | Amir Beck, Nadav Hallak. Optimization problems involving group sparsity terms |
| 69 | -- | 108 | Hongcheng Liu, Xue Wang, Tao Yao, Runze Li, Yinyu Ye. Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming |
| 109 | -- | 143 | Stefania Bellavia, Jacek Gondzio, Margherita Porcelli. An inexact dual logarithmic barrier method for solving sparse semidefinite programs |
| 145 | -- | 213 | Tianxiao Sun, Quoc Tran-Dinh. Generalized self-concordant functions: a recipe for Newton-type methods |
| 215 | -- | 262 | Huikang Liu, Anthony Man-Cho So, Weijie Wu. Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods |
| 263 | -- | 299 | Gabriel Haeser, Hongcheng Liu, Yinyu Ye. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary |
| 301 | -- | 326 | Sebastian Banert, Radu Ioan Bot. A general double-proximal gradient algorithm for d.c. programming |
| 327 | -- | 360 | Yossi Arjevani, Ohad Shamir, Ron Shiff. Oracle complexity of second-order methods for smooth convex optimization |
| 361 | -- | 380 | Michele Conforti, Laurence A. Wolsey. "Facet" separation with one linear program |
| 381 | -- | 415 | Ying Cui, Defeng Sun, Kim-Chuan Toh. On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming |
| 417 | -- | 448 | Jinhak Kim, Mohit Tawarmalani, Jean-Philippe P. Richard. On cutting planes for cardinality-constrained linear programs |
| 449 | -- | 483 | Martin Schmidt 0003, Mathias Sirvent, Winnifried Wollner. A decomposition method for MINLPs with Lipschitz continuous nonlinearities |
| 485 | -- | 501 | Satoru Fujishige, Yoshio Sano, Ping Zhan. Submodular optimization views on the random assignment problem |
| 503 | -- | 558 | Dmitriy Drusvyatskiy, Courtney Paquette. Efficiency of minimizing compositions of convex functions and smooth maps |