Beyond symmetry: best submatrix selection for the sparse truncated SVD Yongchun LiWeijun Xie Full Length Paper 21 December 2023 Pages: 1 - 50
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians Lai TianAnthony Man-Cho So Full Length Paper 06 January 2024 Pages: 51 - 74
A general framework for multi-marginal optimal transport Brendan PassAdolfo Vargas-Jiménez Full Length Paper 05 February 2024 Pages: 75 - 110
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings Alon RiegerDanny Segev Full Length Paper 11 December 2023 Pages: 111 - 171
A single cut proximal bundle method for stochastic convex composite optimization Jiaming LiangVincent GuiguesRenato D. C. Monteiro Full Length Paper 11 December 2023 Pages: 173 - 208
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs Volker Krätschmer Full Length Paper Open access 26 December 2023 Pages: 209 - 242
The exact worst-case convergence rate of the alternating direction method of multipliers Moslem ZamaniHadi AbbaszadehpeivastiEtienne de Klerk Full Length Paper Open access 26 December 2023 Pages: 243 - 276
Hardness and approximation of submodular minimum linear ordering problems Majid FarhadiSwati GuptaMichael C. Wigal Full Length Paper Open access 14 December 2023 Pages: 277 - 318
Complementary composite minimization, small gradients in general norms, and applications Jelena DiakonikolasCristóbal Guzmán Full Length Paper 05 January 2024 Pages: 319 - 363
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods Masoud AhookhoshYurii Nesterov Full Length Paper Open access 04 January 2024 Pages: 365 - 407
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods Masoud AhookhoshYurii Nesterov Correction Open access 10 February 2024 Pages: 409 - 410
Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions” Charles AudetPierre-Yves BouchetLoïc Bourdin Full Length Paper 08 January 2024 Pages: 411 - 424
Asymmetry in the complexity of the multi-commodity network pricing problem Quang Minh BuiMargarida CarvalhoJosé Neto Full Length Paper 03 January 2024 Pages: 425 - 461
FPT algorithms for a special block-structured integer program with applications in scheduling Hua ChenLin ChenGuochuan Zhang Full Length Paper 04 January 2024 Pages: 463 - 496
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming Marcin BriańskiMartin KouteckýFelix Schröder Full Length Paper Open access 20 January 2024 Pages: 497 - 531
Constrained optimization of rank-one functions with indicator variables Soroosh ShafieeFatma Kılınç-Karzan Full Length Paper 20 January 2024 Pages: 533 - 579
Adjustability in robust linear optimization Ningji WeiPeter Zhang Full Length Paper Open access 27 January 2024 Pages: 581 - 628
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization Michelangelo BinIvano NotarnicolaThomas Parisini Full Length Paper Open access 12 February 2024 Pages: 629 - 660
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization Simon ThomäGrit WaltherMaximilian Schiffer Full Length Paper Open access 03 February 2024 Pages: 661 - 716
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems Liaoyuan ZengYongle ZhangXiaozhou Wang Full Length Paper 03 February 2024 Pages: 717 - 761
Deciding whether a lattice has an orthonormal basis is in co-NP Christoph Hunkenschröder Short Communication Open access 19 February 2024 Pages: 763 - 775
