| 1 | -- | 25 | Han Xiao 0003, Qizhi Fang. Arboricity games: the core and the nucleolus |
| 27 | -- | 83 | Yuri Faenza, Danny Segev, Lingyi Zhang. Approximation algorithms for the generalized incremental knapsack problem |
| 85 | -- | 113 | Moslem Zamani, Milan Hladík. Error bounds and a condition number for the absolute value equations |
| 115 | -- | 137 | Nikita Doikov, Yurii E. Nesterov. Affine-invariant contracting-point methods for Convex Optimization |
| 139 | -- | 157 | Alberto Del Pia. Sparse PCA on fixed-rank matrices |
| 159 | -- | 194 | R. Tyrrell Rockafellar. Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality |
| 195 | -- | 254 | Jean-François Aujol, Charles Dossal, Aude Rondepierre. Convergence rates of the Heavy-Ball method under the Łojasiewicz property |
| 255 | -- | 323 | Pavel E. Dvurechensky, Kamil Safin, Shimrit Shtern, Mathias Staudigl. Generalized self-concordant analysis of Frank-Wolfe algorithms |
| 325 | -- | 362 | Raghu Bollapragada, Damien Scieur, Alexandre d'Aspremont. Nonlinear acceleration of momentum and primal-dual algorithms |
| 363 | -- | 397 | Jason M. Altschuler, Pablo A. Parrilo. Near-linear convergence of the Random Osborne algorithm for Matrix Balancing |
| 399 | -- | 441 | James Saunderson, Venkat Chandrasekaran. Terracini convexity |
| 443 | -- | 469 | David H. Gutman, Javier F. Peña 0001. Perturbed Fenchel duality and first-order methods |
| 471 | -- | 505 | Riley Murray, Helen Naumann, Thorsten Theobald. Sublinear circuits and the constrained signomial nonnegativity problem |
| 507 | -- | 537 | Danial Davarnia, Atefeh Rajabalizadeh, John N. Hooker. Achieving consistency with cutting planes |
| 539 | -- | 559 | Santanu S. Dey, Yatharth Dubey, Marco Molinaro 0001. Lower bounds on the size of general branch-and-bound trees |
| 561 | -- | 593 | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001. On the optimality of pseudo-polynomial algorithms for integer programming |
| 595 | -- | 620 | Arash Haddadan, Alantha Newman. Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours |
| 621 | -- | 674 | Haoming Shen, Ruiwei Jiang. Chance-constrained set covering with Wasserstein ambiguity |
| 675 | -- | 732 | Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel. Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates |
| 733 | -- | 785 | Dogyoon Song, Pablo A. Parrilo. On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones |
| 787 | -- | 810 | Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang. Complexity of branch-and-bound and cutting planes in mixed-integer optimization |
| 811 | -- | 853 | Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen. A duality based 2-approximation algorithm for maximum agreement forest |
| 855 | -- | 897 | Bo Jiang, Xiang Meng, Zaiwen Wen, Xiaojun Chen. An exact penalty approach for optimization with nonnegative orthogonality constraints |
| 899 | -- | 936 | Boris S. Mordukhovich, Xiaoming Yuan 0001, Shangzhi Zeng, Jin Zhang 0002. A globally convergent proximal Newton-type method in nonsmooth convex optimization |
| 937 | -- | 996 | Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa. Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry |
| 997 | -- | 1058 | Coralia Cartis, Estelle M. Massart, Adilet Otemissov. Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings |
| 1059 | -- | 1106 | Guanghui Lan. Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes |
| 1107 | -- | 1120 | Aram V. Arutyunov, Sergey E. Zhukovskiy. On implicit function theorem for locally Lipschitz equations |