Equilibrium computation in resource allocation games Tobias HarksVeerle Timmermans Full Length Paper Open access 17 February 2021 Pages: 1 - 34
Correction to: Equilibrium computation in resource allocation games Tobias HarksVeerle Tan-Timmermans Correction Open access 09 May 2022 Pages: 35 - 40
Optimal complexity and certification of Bregman first-order methods Radu-Alexandru DragomirAdrien B. TaylorJérôme Bolte Full Length Paper 21 April 2021 Pages: 41 - 83
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice Takanori MaeharaSo NakashimaYutaro Yamaguchi Full Length Paper 04 February 2021 Pages: 85 - 119
Limited-memory BFGS with displacement aggregation Albert S. BerahasFrank E. CurtisBaoyu Zhou Full Length Paper 29 January 2021 Pages: 121 - 157
Rates of superlinear convergence for classical quasi-Newton methods Anton RodomanovYurii Nesterov Full Length Paper Open access 08 February 2021 Pages: 159 - 190
Complexity of linear relaxations in integer programming Gennadiy AverkovMatthias Schymura Full Length Paper Open access 18 February 2021 Pages: 191 - 227
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications Yuni IwamasaKenjiro Takazawa Full Length Paper 20 February 2021 Pages: 229 - 256
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization Minghan YangAndre MilzarekTong Zhang Full Length Paper 13 March 2021 Pages: 257 - 303
Robust spectral risk optimization when the subjective risk aversion is ambiguous: a moment-type approach Shaoyan GuoHuifu Xu Full Length Paper 22 March 2021 Pages: 305 - 340
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization Joachim DahlErling D. Andersen Full Length Paper Open access 09 March 2021 Pages: 341 - 370
Riemannian proximal gradient methods Wen HuangKe Wei Full Length Paper 09 March 2021 Pages: 371 - 413
A unified approach for a 1D generalized total variation problem Cheng LuDorit S. Hochbaum Full Length Paper Open access 13 March 2021 Pages: 415 - 442
Positivity certificates and polynomial optimization on non-compact semialgebraic sets Ngoc Hoang Anh MaiJean-Bernard LasserreVictor Magron Full Length Paper 04 March 2021 Pages: 443 - 485
Sparse optimization on measures with over-parameterized gradient descent Lénaïc Chizat Full Length Paper 17 March 2021 Pages: 487 - 532
k-Point semidefinite programming bounds for equiangular lines David de LaatFabrício Caluza MachadoFrank Vallentin Full Length Paper Open access 21 April 2021 Pages: 533 - 567
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry Ernest K. RyuRobert HannahWotao Yin Full Length Paper 02 June 2021 Pages: 569 - 619
Optimization on flag manifolds Ke YeKen Sze-Wai WongLek-Heng Lim Full Length Paper 23 June 2021 Pages: 621 - 660
Matroid bases with cardinality constraints on the intersection Stefan LendlBritta PeisVeerle Timmermans Full Length Paper Open access 29 March 2021 Pages: 661 - 684
Iteratively reweighted least squares and slime mold dynamics: connection and convergence Damian StraszakNisheeth K. Vishnoi Full Length Paper 05 April 2021 Pages: 685 - 717
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration Md Sarowar MorshedMd Saiful IslamMd. Noor-E-Alam Full Length Paper 30 March 2021 Pages: 719 - 779
Semidefinite programming hierarchies for constrained bilinear optimization Mario BertaFrancesco BorderiVolkher B. Scholz Full Length Paper Open access 15 April 2021 Pages: 781 - 829
Ideal, non-extended formulations for disjunctive constraints admitting a network representation Tamás KisMarkó Horváth Full Length Paper Open access 16 April 2021 Pages: 831 - 869
Proximity in concave integer quadratic programming Alberto Del PiaMingchen Ma Full Length Paper 20 May 2021 Pages: 871 - 900
On lower iteration complexity bounds for the convex concave saddle point problems Junyu ZhangMingyi HongShuzhong Zhang Full Length Paper 07 June 2021 Pages: 901 - 935
Status determination by interior-point methods for convex optimization problems in domain-driven form Mehdi KarimiLevent Tunçel Full Length Paper 19 June 2021 Pages: 937 - 974
A frequency-domain analysis of inexact gradient methods Oran Gannot Full Length Paper 24 May 2021 Pages: 975 - 1016
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators Kanat CamlibelLuigi IannelliAneel Tanwani Full Length Paper Open access 02 July 2021 Pages: 1017 - 1059
An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems Haihao Lu Full Length Paper 29 June 2021 Pages: 1061 - 1112
Optimal crashing of an activity network with disruptions Haoxiang YangDavid P. Morton Full Length Paper 29 June 2021 Pages: 1113 - 1162
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems Victor I. KolobovSimeon ReichRafał Zalas Short Communication 25 February 2021 Pages: 1163 - 1183
Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric G. BeerM. J. CánovasJ. Parra Correction Open access 22 December 2021 Pages: 1185 - 1186
Correction to: Complexity of stochastic dual dynamic programming Guanghui Lan Correction 11 March 2022 Pages: 1187 - 1189