A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds Yuhao ZhouChenglong BaoJun Zhu Full Length Paper 05 October 2022 Pages: 1 - 61
An elementary approach to tight worst case complexity analysis of gradient based methods Marc TeboulleYakov Vaisbourd Full Length Paper 13 October 2022 Pages: 63 - 96
Trace ratio optimization with an application to multi-view learning Li WangLei-Hong ZhangRen-Cang Li Full Length Paper 07 October 2022 Pages: 97 - 131
Faster first-order primal-dual methods for linear programming using restarts and sharpness David ApplegateOliver HinderMiles Lubin Full Length Paper 19 October 2022 Pages: 133 - 184
Principled analyses and design of first-order methods with inexact proximal operators Mathieu BarréAdrien B. TaylorFrancis Bach Full Length Paper 17 December 2022 Pages: 185 - 230
Resolvent splitting for sums of monotone operators with minimal lifting Yura MalitskyMatthew K. Tam Full Length Paper 27 December 2022 Pages: 231 - 262
An approximation algorithm for indefinite mixed integer quadratic programming Alberto Del Pia Full Length Paper 02 December 2022 Pages: 263 - 293
Supermodularity and valid inequalities for quadratic optimization with indicators Alper AtamtürkAndrés Gómez Full Length Paper Open access 22 December 2022 Pages: 295 - 338
Consistent approximations in composite optimization Johannes O. Royset Full Length Paper 28 December 2022 Pages: 339 - 372
The landscape of the proximal point method for nonconvex–nonconcave minimax optimization Benjamin GrimmerHaihao LuVahab Mirrokni Full Length Paper 01 December 2022 Pages: 373 - 407
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization Heng YangLing LiangKim-Chuan Toh Full Length Paper 29 November 2022 Pages: 409 - 472
Hessian averaging in stochastic Newton methods achieves superlinear convergence Sen NaMichał DerezińskiMichael W. Mahoney Full Length Paper Open access 13 December 2022 Pages: 473 - 520
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems Lior DoronShimrit Shtern Full Length Paper 27 December 2022 Pages: 521 - 558
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations Robert J. BaraldiDrew P. Kouri Full Length Paper 26 December 2022 Pages: 559 - 598
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification Ching-pei Lee Full Length Paper Open access 12 January 2023 Pages: 599 - 633
A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems Zi XuHuiling ZhangGuanghui Lan Full Length Paper 02 January 2023 Pages: 635 - 706
Softmax policy gradient methods can take exponential time to converge Gen LiYuting WeiYuxin Chen Full Length Paper Open access 23 January 2023 Pages: 707 - 802
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints Qimeng YuSimge Küçükyavuz Full Length Paper 09 January 2023 Pages: 803 - 861
Constrained composite optimization and augmented Lagrangian methods Alberto De MarchiXiaoxi JiaPatrick Mehlitz Full Length Paper Open access 08 February 2023 Pages: 863 - 896
Smooth over-parameterized solvers for non-smooth structured optimization Clarice PoonGabriel Peyré Full Length Paper 08 February 2023 Pages: 897 - 952