| 1 | -- | 25 | Nikita Doikov, Yurii E. Nesterov. Gradient regularization of Newton method with Bregman distances |
| 27 | -- | 79 | Yuni Iwamasa. A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices |
| 81 | -- | 111 | Bertrand Guenin, Cheolwon Heo. Small separations in pinch-graphic matroids |
| 113 | -- | 134 | Bertrand Guenin, Cheolwon Heo. Recognizing pinch-graphic matroids |
| 135 | -- | 206 | Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix |
| 207 | -- | 254 | Azam Asl, Haihao Lu, Jinwen Yang. A J-symmetric quasi-newton method for minimax problems |
| 255 | -- | 297 | Digvijay Boob, Cristóbal Guzmán. Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems |
| 299 | -- | 347 | Tianyun Tang, Kim-Chuan Toh. Solving graph equipartition SDPs on an algebraic variety |
| 349 | -- | 383 | Tongseok Lim. Geometry of vectorial martingale optimal transportations and duality |
| 385 | -- | 413 | Bochuan Lyu, Illya V. Hicks, Joey Huchette. Modeling combinatorial disjunctive constraints via junction trees |
| 415 | -- | 447 | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. Diverse collections in matroids and graphs |
| 449 | -- | 491 | Jean-François Aujol, Charles Dossal, Aude Rondepierre. FISTA is an automatic geometrically optimized algorithm for strongly convex functions |
| 493 | -- | 516 | Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur. Approximation algorithms for flexible graph connectivity |
| 517 | -- | 566 | Ziyu He, Shaoning Han, Andrés Gómez 0001, Ying Cui 0004, Jong-Shi Pang. Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix |
| 567 | -- | 639 | Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu. Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods |
| 641 | -- | 0 | Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu. Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods |
| 643 | -- | 676 | Norihide Tokushige. The maximum measure of non-trivial 3-wise intersecting families |
| 677 | -- | 702 | Timm Oertel, Joseph Paat, Robert Weismantel. A colorful Steinitz Lemma with application to block-structured integer programs |
| 703 | -- | 737 | Linchuan Wei, Alper Atamtürk, Andrés Gómez 0001, Simge Küçükyavuz. On the convex hull of convex quadratic optimization problems with indicators |
| 739 | -- | 752 | Ilias Zadik, Miles Lubin, Juan Pablo Vielma. Shapes and recession cones in mixed-integer convex representability |
| 753 | -- | 764 | Bruno F. Lourenço, Vera Roshchina, James Saunderson. Hyperbolicity cones are amenable |