| 1 | -- | 36 | Jérôme Bolte, Zheng Chen 0009, Edouard Pauwels. The multiproximal linearization method for convex composite problems |
| 37 | -- | 55 | Damián R. Fernández, Mikhail V. Solodov. On the cost of solving augmented Lagrangian subproblems |
| 57 | -- | 102 | Aharon Ben-Tal, Omar El Housni, Vineet Goyal. A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization |
| 103 | -- | 140 | Wenzhuo Yang, Melvyn Sim, Huan Xu. Goal scoring, coherent loss and applications to machine learning |
| 141 | -- | 174 | Takanori Maehara, Yutaro Yamaguchi 0001. Stochastic packing integer programs with few queries |
| 175 | -- | 198 | Iskander Aliev, Martin Henk, Timm Oertel. Distances to lattice points in knapsack polyhedra |
| 199 | -- | 232 | Thiago Serra, John N. Hooker. Compact representation of near-optimal integer programming solutions |
| 233 | -- | 273 | Ernest K. Ryu. Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting |
| 275 | -- | 314 | Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis. Vector coloring the categorical product of graphs |
| 315 | -- | 354 | Joe Cheriyan, Jack Dippel, Fabrizio Grandoni 0001, Arindam Khan 0001, Vishnu V. Narayan. The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm |
| 355 | -- | 367 | Samuel Fiorini, Gwenaël Joret, Oliver Schaudt. Improved approximation algorithms for hitting 3-vertex paths |
| 369 | -- | 397 | Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. Sum-of-squares hierarchy lower bounds for symmetric formulations |
| 399 | -- | 428 | Diego Cifuentes, Corey Harris, Bernd Sturmfels. The geometry of SDP-exactness in quadratic optimization |
| 429 | -- | 443 | Amir Ali Ahmadi, Georgina Hall. On the complexity of detecting convexity over a box |
| 445 | -- | 464 | Guillaume Perez, Michel Barlaud, Lionel Fillatre, Jean-Charles Régin. 1 ball |