| 1 | -- | 50 | Yongchun Li, Weijun Xie 0001. Beyond symmetry: best submatrix selection for the sparse truncated SVD |
| 51 | -- | 74 | Lai Tian, Anthony Man-Cho So. No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians |
| 75 | -- | 110 | Brendan Pass, Adolfo Vargas-Jiménez. A general framework for multi-marginal optimal transport |
| 111 | -- | 171 | Alon Rieger, Danny Segev. Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings |
| 173 | -- | 208 | Jiaming Liang, Vincent Guigues, Renato D. C. Monteiro. A single cut proximal bundle method for stochastic convex composite optimization |
| 209 | -- | 242 | Volker Krätschmer. First order asymptotics of the sample average approximation method to solve risk averse stochastic programs |
| 243 | -- | 276 | Moslem Zamani, Hadi Abbaszadehpeivasti, Etienne de Klerk. The exact worst-case convergence rate of the alternating direction method of multipliers |
| 277 | -- | 318 | Majid Farhadi, Swati Gupta 0001, Shengding Sun, Prasad Tetali, Michael C. Wigal. Hardness and approximation of submodular minimum linear ordering problems |
| 319 | -- | 363 | Jelena Diakonikolas, Cristóbal Guzmán. Complementary composite minimization, small gradients in general norms, and applications |
| 365 | -- | 407 | Masoud Ahookhosh, Yurii E. Nesterov. High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods |
| 409 | -- | 410 | Masoud Ahookhosh, Yurii E. Nesterov. Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods |
| 411 | -- | 424 | Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin. Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions" |
| 425 | -- | 461 | Quang Minh Bui, Margarida Carvalho, José Neto 0001. Asymmetry in the complexity of the multi-commodity network pricing problem |
| 463 | -- | 496 | Hua Chen, Lin Chen 0009, Guochuan Zhang. FPT algorithms for a special block-structured integer program with applications in scheduling |
| 497 | -- | 531 | Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder. Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming |
| 533 | -- | 579 | Soroosh Shafiee, Fatma Kilinç-Karzan. Constrained optimization of rank-one functions with indicator variables |
| 581 | -- | 628 | Ningji Wei, Peter Yun Zhang. Adjustability in robust linear optimization |
| 629 | -- | 660 | Michelangelo Bin, Ivano Notarnicola, Thomas Parisini. Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization |
| 661 | -- | 716 | Simon Thomä, Grit Walther, Maximilian Schiffer. Designing tractable piecewise affine policies for multi-stage adjustable robust optimization |
| 717 | -- | 761 | Liaoyuan Zeng, Yongle Zhang, Guoyin Li 0001, Ting Kei Pong, Xiaozhou Wang. Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems |
| 763 | -- | 775 | Christoph Hunkenschröder. Deciding whether a lattice has an orthonormal basis is in co-NP |