| 445 | -- | 486 | Alex L. Wang, Fatma Kilinç-Karzan. The generalized trust region subproblem: solution complexity and convex hull results |
| 487 | -- | 558 | Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin. Complete positivity and distance-avoiding sets |
| 559 | -- | 594 | Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta. New limits of treewidth-based tractability in optimization |
| 595 | -- | 629 | Utkan Onur Candogan, Venkat Chandrasekaran. Convex graph invariant relaxations for graph edit distance |
| 631 | -- | 670 | Patrick R. Johnstone, Jonathan Eckstein. Projective splitting with forward steps |
| 671 | -- | 715 | Derek Driggs, Matthias J. Ehrhardt, Carola-Bibiane Schönlieb. Accelerating variance-reduced stochastic gradient methods |
| 717 | -- | 754 | Guanghui Lan. Complexity of stochastic dual dynamic programming |
| 755 | -- | 793 | Shabbir Ahmed 0001, Filipe Goulart Cabral, Bernardo Freitas Paulo da Costa. Stochastic Lipschitz dynamic programming |
| 795 | -- | 845 | Simon Bruggmann, Rico Zenklusen. An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint |
| 847 | -- | 869 | José R. Correa, Felipe T. Muñoz. Performance guarantees of local search for minsum scheduling problems |
| 871 | -- | 906 | Adriana Kiszka, David Wozabal. A stability result for linear Markovian stochastic optimization problems |
| 907 | -- | 951 | Loïc Bourdin, Gaurav Dhar. Optimal sampled-data controls with running inequality state constraints: Pontryagin maximum principle and bouncing trajectory phenomenon |
| 953 | -- | 979 | Aaron Bernstein, Yann Disser, Martin Groß 0001, Sandra Himburg. General bounds for incremental maximization |
| 981 | -- | 1004 | Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro 0001, Shengding Sun. Sparse PSD approximation of the PSD cone |
| 1005 | -- | 1071 | Quoc Tran-Dinh, Nhan H. Pham, Dzung T. Phan, Lam M. Nguyen. A hybrid stochastic optimization framework for composite nonconvex optimization |