A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices Hiroshi HiraiYuni Iwamasa Full Length Paper 18 June 2021 Pages: 1 - 37
Bootstrap robust prescriptive analytics Dimitris BertsimasBart Van Parys Full Length Paper 25 June 2021 Pages: 39 - 78
Understanding the acceleration phenomenon via high-resolution differential equations Bin ShiSimon S. DuWeijie J. Su Full Length Paper Open access 06 July 2021 Pages: 79 - 148
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem Hiroshi HiraiMotoki Ikeda Full Length Paper 21 July 2021 Pages: 149 - 181
Fully polynomial time \((\Sigma ,\Pi )\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs Nir HalmanGiacomo Nannicini Full Length Paper 26 July 2021 Pages: 183 - 242
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs Murat A. ErdogduAsuman OzdaglarNuri Denizcan Vanli Full Length Paper 30 July 2021 Pages: 243 - 281
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens Fatma Kılınç-KarzanSimge KüçükyavuzDabeen Lee Full Length Paper 21 July 2021 Pages: 283 - 326
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods M. Paul LaiuAndré L. Tits Full Length Paper 21 July 2021 Pages: 327 - 366
Empowering the configuration-IP: new PTAS results for scheduling with setup times Klaus JansenKim-Manuel KleinMalin Rau Full Length Paper Open access 11 August 2021 Pages: 367 - 401
Integer plane multiflow maximisation: one-quarter-approximation and gaps Naveen GargNikhil KumarAndrás Sebő Full Length Paper 16 August 2021 Pages: 403 - 419
On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint Haixiang ZhangAndre MilzarekWotao Yin Full Length Paper 21 August 2021 Pages: 421 - 473
Set characterizations and convex extensions for geometric convex-hull proofs Andreas BärmannOskar Schneider Full Length Paper Open access 14 September 2021 Pages: 475 - 515
Worst-case analysis of clique MIPs Mohammad Javad NaderiAustin BuchananJose L. Walteros Full Length Paper 23 September 2021 Pages: 517 - 551
Curiosities and counterexamples in smooth convex optimization Jérôme BolteEdouard Pauwels Full Length Paper 09 October 2021 Pages: 553 - 603
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction Veronika GrimmDaniel NowakGregor Zöttl Full Length Paper Open access 13 December 2021 Pages: 605 - 647
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization Junyu ZhangLin Xiao Full Length Paper 06 October 2021 Pages: 649 - 691
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions Vivak Patel Full Length Paper 29 October 2021 Pages: 693 - 734
From differential equation solvers to accelerated first-order methods for convex optimization Hao LuoLong Chen Full Length Paper Open access 12 October 2021 Pages: 735 - 781
On the complexity of finding a local minimizer of a quadratic function over a polytope Amir Ali AhmadiJeffrey Zhang Full Length Paper 04 January 2022 Pages: 783 - 792
Non-convex exact community recovery in stochastic block model Peng WangZirui ZhouAnthony Man-Cho So Full Length Paper 11 November 2021 Pages: 1 - 37
Discrete 2-convex functions Satoru FujishigeFabio Tardella Full Length Paper 26 October 2021 Pages: 831 - 854
Best approximation mappings in Hilbert spaces Heinz H. BauschkeHui OuyangXianfu Wang Full Length Paper 26 October 2021 Pages: 855 - 901
A Lagrange–Newton algorithm for sparse nonlinear programming Chen ZhaoNaihua XiuZiyan Luo Full Length Paper 21 October 2021 Pages: 903 - 928
A control-theoretic perspective on optimal high-order optimization Tianyi LinMichael I. Jordan Full Length Paper Open access 22 October 2021 Pages: 929 - 975
Decreasing minimization on M-convex sets: background and structures András FrankKazuo Murota Full Length Paper 27 October 2021 Pages: 977 - 1025
Decreasing minimization on M-convex sets: algorithms and applications András FrankKazuo Murota Full Length Paper 15 October 2021 Pages: 1027 - 1068
Distributionally robust stochastic programs with side information based on trimmings Adrián Esteban-PérezJuan M. Morales Full Length Paper Open access 22 November 2021 Pages: 1069 - 1105
On linear optimization over Wasserstein balls Man-Chung YueDaniel KuhnWolfram Wiesemann Short Communication 17 June 2021 Pages: 1107 - 1122
Computing the nucleolus of weighted voting games in pseudo-polynomial time Kanstantsin Pashkovich Short Communication 24 August 2021 Pages: 1123 - 1133
The aggregation closure is polyhedral for packing and covering integer programs Kanstantsin PashkovichLaurent PoirrierHaripriya Pulyassary Short Communication 01 November 2021 Pages: 1135 - 1147