| 1 | -- | 32 | Grani Adiwena Hanasusanto, Daniel Kuhn, Stein W. Wallace, Steve Zymler. Distributionally robust multi-item newsvendor problems with multimodal demand distributions |
| 33 | -- | 73 | Alexey F. Izmailov, E. I. Uskov. Attraction of Newton method to critical Lagrange multipliers: fully quadratic case |
| 75 | -- | 112 | Zaïd Harchaoui, Anatoli Juditsky, Arkadi Nemirovski. Conditional gradient algorithms for norm-regularized smooth convex optimization |
| 113 | -- | 146 | Jacek Gondzio, Pablo González-Brevis. A new warmstarting strategy for the primal-dual column generation method |
| 147 | -- | 188 | A. Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer. Efficient cost-sharing mechanisms for prize-collecting problems |
| 189 | -- | 200 | Ashwin Arulselvan. On the geometric rank of matching polytope |
| 201 | -- | 245 | Frank E. Curtis, Hao Jiang, Daniel P. Robinson. An adaptive augmented Lagrangian method for large-scale constrained optimization |
| 247 | -- | 274 | Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese. Assigning sporadic tasks to unrelated machines |
| 275 | -- | 300 | Václav Kozmík, David P. Morton. Evaluating policies in risk-averse multi-stage stochastic programming |
| 301 | -- | 338 | Angelos Georghiou, Wolfram Wiesemann, Daniel Kuhn. Generalized decision rule approximations for stochastic programming via liftings |
| 339 | -- | 380 | Yair Censor, Daniel Reem. Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods |
| 381 | -- | 404 | Yu. Nesterov. Universal gradient methods for convex optimization problems |
| 405 | -- | 434 | Nikolaos Chatzipanagiotis, Darinka Dentcheva, Michael M. Zavlanos. An augmented Lagrangian method for distributed optimization |
| 435 | -- | 466 | Takanori Maehara, Kazuo Murota. A framework of discrete DC programming by discrete convex analysis |
| 467 | -- | 490 | Y. Diouane, Serge Gratton, L. N. Vicente. Globally convergent evolution strategies |
| 491 | -- | 520 | Geovani N. Grapiglia, Jinyun Yuan, Ya-Xiang Yuan. On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization |
| 521 | -- | 544 | Dmitriy Drusvyatskiy, Stephen A. Vavasis, Henry Wolkowicz. Extreme point inequalities and geometry of the rank sparsity ball |
| 545 | -- | 557 | Ehud Lehrer, Roee Teper. Sandwich games |
| 559 | -- | 591 | Jean B. Lasserre. A generalization of Löwner-John's ellipsoid theorem |
| 593 | -- | 614 | Jiming Peng, Tao Zhu. A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties |
| 615 | -- | 642 | Zhaosong Lu, Lin Xiao. On the complexity analysis of randomized block-coordinate descent methods |
| 643 | -- | 651 | Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz. Sufficiency of cut-generating functions |