| 1 | -- | 20 | Laurence A. Wolsey, Hande Yaman. Continuous knapsack sets with divisible capacities |
| 21 | -- | 57 | Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos. A dynamic inequality generation scheme for polynomial programming |
| 59 | -- | 99 | Saeed Ghadimi, Guanghui Lan. Accelerated gradient methods for nonconvex nonlinear and stochastic programming |
| 101 | -- | 123 | Oliver Stein. Error bounds for mixed integer linear optimization problems |
| 125 | -- | 159 | Welington de Oliveira, Mikhail V. Solodov. A doubly stabilized bundle method for nonsmooth convex optimization |
| 161 | -- | 187 | Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh. A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems |
| 189 | -- | 219 | Kimon Fountoulakis, Jacek Gondzio. A second-order method for strongly convex ℓ 1 -regularization problems |
| 221 | -- | 256 | Anatoli Juditsky, Arkadi Nemirovski. Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles |
| 257 | -- | 270 | Radek Cibulka, Asen L. Dontchev. A nonsmooth Robinson's inverse function theorem in Banach spaces |
| 271 | -- | 302 | Bart P. G. Van Parys, Paul J. Goulart, Daniel Kuhn. Generalized Gauss inequalities via semidefinite programming |
| 303 | -- | 330 | Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi. The convex recoloring problem: polyhedra, facets and computational experiments |
| 331 | -- | 342 | Michele Conforti, Kanstantsin Pashkovich. The projected faces property and polyhedral relations |
| 343 | -- | 389 | Steffen Rebennack. Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming |
| 391 | -- | 431 | Jun-ya Gotoh, Stan Uryasev. Two pairs of families of polyhedral norms versus ℓ p -norms: proximity and applications in optimization |
| 433 | -- | 484 | Peter Richtárik, Martin Takác. Parallel coordinate descent methods for big data optimization |
| 485 | -- | 511 | Vladimir Yu. Protasov. Spectral simplex method |
| 513 | -- | 547 | Yong Xia, Shu Wang, Ruey-Lin Sheu. S-lemma with equality and its applications |
| 549 | -- | 579 | Sebastian U. Stich, Christian L. Müller, Bernd Gärtner. Variable metric random pursuit |
| 581 | -- | 613 | Ashwin Nayak, Jamie Sikora, Levent Tunçel. A search for quantum coin-flipping protocols using optimization techniques |
| 615 | -- | 656 | Shimrit Shtern, Aharon Ben-Tal. A semi-definite programming approach for robust tracking |