| 1 | -- | 27 | Amir Beck, Shimrit Shtern. Linearly convergent away-step conditional gradient for non-strongly convex functions |
| 29 | -- | 53 | Silvia Vogel. Random approximations in multiobjective optimization |
| 55 | -- | 90 | Francisco Facchinei, Lorenzo Lampariello, Gesualdo Scutari. Feasible methods for nonconvex nonsmooth problems with applications in green communications |
| 91 | -- | 128 | Luca Consolini, Marco Locatelli. On the complexity of quadratic programming with two quadratic constraints |
| 129 | -- | 155 | Maurice Queyranne, Laurence A. Wolsey. Tight MIP formulations for bounded up/down times and interval-dependent start-ups |
| 167 | -- | 191 | Miguel A. Goberna, Nader Kanzi. Optimality conditions in convex multiobjective SIP |
| 193 | -- | 227 | Chanaka Edirisinghe, Jaehwan Jeong. Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time |
| 229 | -- | 243 | Anne Greenbaum, Adrian S. Lewis, Michael L. Overton. Variational analysis of the Crouzeix ratio |
| 245 | -- | 262 | Yohann Benchetrit. Integer round-up property for the chromatic number of some h-perfect graphs |
| 263 | -- | 284 | Heinz H. Bauschke, Walaa M. Moursi. On the Douglas-Rachford algorithm |
| 285 | -- | 324 | James Cussens, David Haws, Milan Studený. Polyhedral aspects of score equivalence in Bayesian network structure learning |
| 325 | -- | 339 | Friedrich Eisenbrand, Santosh Vempala. Geometric random edge |
| 341 | -- | 381 | Chao Ding, Hou-Duo Qi. Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction |
| 383 | -- | 409 | Sina Modaresi, Juan Pablo Vielma. Convex hull of two quadratic or a conic quadratic and a quadratic inequality |