| 1 | -- | 61 | Yuhao Zhou, Chenglong Bao, Chao Ding, Jun Zhu 0001. A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds |
| 63 | -- | 96 | Marc Teboulle, Yakov Vaisbourd. An elementary approach to tight worst case complexity analysis of gradient based methods |
| 97 | -- | 131 | Li Wang 0033, Lei-Hong Zhang, Ren-Cang Li. Trace ratio optimization with an application to multi-view learning |
| 133 | -- | 184 | David L. Applegate, Oliver Hinder, Haihao Lu, Miles Lubin. Faster first-order primal-dual methods for linear programming using restarts and sharpness |
| 185 | -- | 230 | Mathieu Barré, Adrien B. Taylor, Francis R. Bach. Principled analyses and design of first-order methods with inexact proximal operators |
| 231 | -- | 262 | Yura Malitsky, Matthew K. Tam. Resolvent splitting for sums of monotone operators with minimal lifting |
| 263 | -- | 293 | Alberto Del Pia. An approximation algorithm for indefinite mixed integer quadratic programming |
| 295 | -- | 338 | Alper Atamtürk, Andrés Gómez 0001. Supermodularity and valid inequalities for quadratic optimization with indicators |
| 339 | -- | 372 | Johannes O. Royset. Consistent approximations in composite optimization |
| 373 | -- | 407 | Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab Mirrokni. The landscape of the proximal point method for nonconvex-nonconcave minimax optimization |
| 409 | -- | 472 | Heng Yang 0002, Ling Liang, Luca Carlone, Kim-Chuan Toh. An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization |
| 473 | -- | 520 | Sen Na, Michal Derezinski, Michael W. Mahoney. Hessian averaging in stochastic Newton methods achieves superlinear convergence |
| 521 | -- | 558 | Lior Doron, Shimrit Shtern. Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems |
| 559 | -- | 598 | Robert J. Baraldi, Drew P. Kouri. A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations |
| 599 | -- | 633 | Ching-Pei Lee. Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification |
| 635 | -- | 706 | Zi Xu, Huiling Zhang, Yang Xu, Guanghui Lan. A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems |
| 707 | -- | 802 | Gen Li 0005, Yuting Wei, Yuejie Chi, Yuxin Chen 0002. Softmax policy gradient methods can take exponential time to converge |
| 803 | -- | 861 | Qimeng Yu, Simge Küçükyavuz. Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints |
| 863 | -- | 896 | Alberto De Marchi, Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz. Constrained composite optimization and augmented Lagrangian methods |
| 897 | -- | 952 | Clarice Poon, Gabriel Peyré. Smooth over-parameterized solvers for non-smooth structured optimization |