| 1 | -- | 49 | Shuvomoy Das Gupta, Robert M. Freund, Xu Andy Sun, Adrien Taylor. Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses |
| 51 | -- | 106 | Silvana M. Pesenti, Qiuqi Wang, Ruodu Wang. Optimizing distortion riskmetrics with distributional uncertainty |
| 107 | -- | 149 | Taotao He, Siyue Liu, Mohit Tawarmalani. Convexification techniques for fractional programs |
| 151 | -- | 199 | Quentin Rebjock, Nicolas Boumal. 2 functions |
| 201 | -- | 237 | Richard Y. Zhang. Complexity of chordal conversion for sparse semidefinite programs with small treewidth |
| 239 | -- | 280 | Sasila Ilandarideva, Anatoli B. Juditsky, Guanghui Lan, Tianjiao Li. Accelerated stochastic approximation with state-dependent noise |
| 281 | -- | 341 | Alexandros Hollender, Manolis Zampetakis. The computational complexity of finding stationary points in non-convex optimization |
| 343 | -- | 384 | Quentin Rebjock, Nicolas Boumal. Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices |
| 385 | -- | 432 | Francisco J. Aragón Artacho, Boris S. Mordukhovich, Pedro Pérez-Aros. Coderivative-based semi-Newton method in nonsmooth difference programming |
| 433 | -- | 471 | Puya Latafat, Andreas Themelis, Lorenzo Stella, Panagiotis Patrinos. Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient |
| 473 | -- | 516 | Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel. Dyadic linear programming and extensions |
| 517 | -- | 573 | Evelyne Hubert, Tobias Metzlaff, Philippe Moustrou, Cordian Riener. Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs |
| 575 | -- | 638 | Nan Jiang, Weijun Xie 0001. ALSO-X#: better convex approximations for distributionally robust chance constrained programs |
| 639 | -- | 698 | Mohammed Rayyan Sheriff, Peyman Mohajerin Esfahani. Nonlinear distributionally robust optimization |
| 699 | -- | 736 | Alberto Del Pia. The mixed integer trust region problem |
| 737 | -- | 769 | Burak Bartan, Mert Pilanci. Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time |
| 771 | -- | 822 | Naoki Marumo, Takayuki Okuno, Akiko Takeda. Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence |
| 823 | -- | 861 | Ahmad Abdi, Dabeen Lee. From coordinate subspaces over finite fields to ideal multipartite uniform clutters |
| 863 | -- | 905 | Florentin Goyens, Clément W. Royer. Riemannian trust-region methods for strict saddle functions with complexity guarantees |
| 907 | -- | 940 | Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Dabeen Lee. A projection-free method for solving convex bilevel optimization problems |
| 941 | -- | 984 | Hiroshi Hirai 0001, Yuni Iwamasa, Taihei Oki, Tasuku Soma. Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices |
| 985 | -- | 1008 | Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese. Exact and approximation algorithms for routing a convoy through a graph |
| 1009 | -- | 1038 | Richard Y. Zhang. Improved global guarantees for the nonconvex Burer-Monteiro factorization via rank overparameterization |
| 1039 | -- | 1062 | Christoph Buchheim. Extended formulations for binary optimal control problems |
| 1063 | -- | 1104 | Zhaosong Lu, Sanyou Mei. A first-order augmented Lagrangian method for constrained minimax optimization |
| 1105 | -- | 1118 | Jason M. Altschuler, Pablo A. Parrilo. Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization |
| 1119 | -- | 1168 | Shenglong Hu, Defeng Sun, Kim-Chuan Toh. Quantifying low rank approximations of third order symmetric tensors |
| 1169 | -- | 1209 | Yu-Hin Au, Levent Tunçel. On rank-monotone graph operations and minimal obstruction graphs for the Lovász-Schrijver SDP hierarchy |
| 1211 | -- | 1233 | Pierre Hoppenot, Mathis Martin, Zoltán Szigeti. Regular packing of rooted hyperforests with root constraints in hypergraphs |
| 1235 | -- | 1277 | Irina Wang, Cole Becker, Bart P. G. Van Parys, Bartolomeo Stellato. Mean robust optimization |
| 1279 | -- | 0 | Pierre Hoppenot, Mathis Martin, Zoltán Szigeti. Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs |