Inexact accelerated high-order proximal-point methods Yurii Nesterov Full Length Paper Open access 11 November 2021 Pages: 1 - 26
Multicriteria cuts and size-constrained k-cuts in hypergraphs Calvin BeidemanKarthekeyan ChandrasekaranChao Xu Full Length Paper 29 November 2021 Pages: 27 - 69
Sum-of-squares chordal decomposition of polynomial matrix inequalities Yang ZhengGiovanni Fantuzzi Full Length Paper Open access 20 November 2021 Pages: 71 - 108
Characterizing the universal rigidity of generic tensegrities Ryoshun ObaShin-ichi Tanigawa Full Length Paper Open access 29 November 2021 Pages: 109 - 145
Binary optimal control by trust-region steepest descent Mirko HahnSven LeyfferSebastian Sager Full Length Paper Open access 01 January 2022 Pages: 147 - 190
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm Cyrille W. CombettesSebastian Pokutta Full Length Paper 30 November 2021 Pages: 191 - 214
Stochastic first-order methods for convex and nonconvex functional constrained optimization Digvijay BoobQi DengGuanghui Lan Full Length Paper 21 January 2022 Pages: 215 - 279
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow Anders EltvedSamuel Burer Full Length Paper 08 January 2022 Pages: 281 - 306
Box-total dual integrality and edge-connectivity Michele BarbatoRoland GrappeEmiliano Lancini Full Length Paper 30 January 2022 Pages: 307 - 336
On the robustness of potential-based flow networks Max KlimmMarc E. PfetschMartin Skutella Full Length Paper Open access 09 February 2022 Pages: 337 - 374
Variance reduction for root-finding problems Damek Davis Full Length Paper 30 January 2022 Pages: 375 - 410
A reformulation-linearization technique for optimization over simplices Aras SelviDick den HertogWolfram Wiesemann Short Communication Open access 05 November 2021 Pages: 427 - 447