| 1 | -- | 56 | Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel. A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem |
| 57 | -- | 93 | Guillermo Gallego 0001, Danny Segev. A prophet inequality based approach to the adaptive ProbeTop$\varvec{K}$ problem |
| 95 | -- | 143 | Samuel C. Gutekunst, Billy Jin, David P. Williamson. The two-stripe symmetric circulant TSP is in P |
| 145 | -- | 191 | Teemu Pennanen, Ari-Pekka Perkkiö. Duality in convex stochastic optimization |
| 193 | -- | 236 | Kun Huang, Shi Pu 0004, Angelia Nedic. An accelerated distributed stochastic gradient method with momentum |
| 237 | -- | 267 | Landi Zhu, Mert Gürbüzbalaban, Andrzej Ruszczynski. Mean-semideviation-based distributionally robust learning with weakly convex losses: convergence rates and finite-sample guarantees |
| 269 | -- | 324 | Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert. Polyhedral Newton-min algorithms for complementarity problems |
| 325 | -- | 367 | Niels Lindner, Berenike Masing. On the split closure of the periodic timetabling polytope |
| 369 | -- | 405 | Jiawang Nie, Zheng Qu 0001, Xindong Tang, Linghao Zhang. A characterization for tightness of the sparse Moment-SOS hierarchy |
| 407 | -- | 452 | Michael Muehlebach, Michael I. Jordan. Accelerated first-order optimization under nonlinear constraints |
| 453 | -- | 505 | Daniele Catanzaro, Raffaele Pesenti, Allan Sapucaia, Laurence A. Wolsey. Optimizing over path-length matrices of unrooted binary trees |
| 507 | -- | 537 | Egon Balas, Aleksandr M. Kazachkov. V-polyhedral disjunctive cuts |
| 539 | -- | 574 | Jérôme Bolte, Quoc-Tung Le, Edouard Pauwels, Samuel Vaiter. Geometric and computational hardness of bilevel programming |
| 575 | -- | 636 | Chang He 0006, Yuntian Jiang, Chuwen Zhang, Dongdong Ge, Bo Jiang 0007, Yinyu Ye 0001. Homogeneous second-order descent framework: a fast alternative to Newton-type methods |
| 637 | -- | 668 | Liang Chen 0006, Ruoning Chen, Defeng Sun, Liping Zhang 0008. Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming |
| 669 | -- | 715 | Coralia Cartis, Wenqi Zhu. Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods |
| 717 | -- | 741 | Andrew D. McRae. Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms |
| 743 | -- | 769 | Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez 0001. A minimal face constant rank constraint qualification for reducible conic programming |
| 771 | -- | 808 | Haihao Lu, Jinwen Yang. A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming |
| 809 | -- | 858 | Lénaïc Chizat, Alex Delalande, Tomas Vaskevicius. Sharper exponential convergence rates for Sinkhorn's algorithm in continuous settings |
| 859 | -- | 861 | Kun Huang, Shi Pu 0004, Angelia Nedic. Correction: An accelerated distributed stochastic gradient method with momentum |