| Publication | Date of Publication | Type |
|---|
First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
(available as arXiv preprint) | N/A | Paper |
On Averaging and Extrapolation for Gradient Descent
(available as arXiv preprint) | N/A | Paper |
Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
(available as arXiv preprint) | N/A | Paper |
Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
(available as arXiv preprint) | N/A | Paper |
Some New Insights from Highly Optimized Polyhedral Passages
American Mathematical Monthly | 2026-09-25 | Paper |
On averaging and extrapolation for gradient descent
Mathematics of Operations Research | 2026-09-15 | Paper |
Some unified theory for variance reduced prox-linear methods
SIAM Journal on Optimization | 2026-08-13 | Paper |
The optimal smoothings of sublinear functions and convex cones
Set-Valued and Variational Analysis | 2026-07-21 | Paper |
A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
(available as arXiv preprint) | 2026-01-01 | Paper |
A Practical Adaptive Subgame Perfect Gradient Method
(available as arXiv preprint) | 2026-01-01 | Paper |
Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
(available as arXiv preprint) | 2026-01-01 | Paper |
Nonsmooth Riemannian optimization with inexact manifold primitives via bundle methods
(available as arXiv preprint) | 2026-01-01 | Paper |
A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
(available as arXiv preprint) | 2026-01-01 | Paper |
A Parameter-Free Restart Scheme with Only a Parallelizable \log\log(1/ε) Overhead
(available as arXiv preprint) | 2026-01-01 | Paper |
Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
(available as arXiv preprint) | 2026-01-01 | Paper |
A Complete Characterization of Optimal Subgradient Methods for Lipschitz Convex Minimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Implicit Primal-Dual Guarantees in Unconstrained First-Order Minimization
(available as arXiv preprint) | 2026-01-01 | Paper |
On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Some primal-dual theory for subgradient methods for strongly convex optimization
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
SIAM Journal on Optimization | 2025-06-25 | Paper |
Goldstein stationarity in Lipschitz constrained optimization
Optimization Letters | 2025-06-24 | Paper |
| Limiting behaviors of nonconvex-nonconcave minimax optimization via continuous-time systems | 2025-02-11 | Paper |
The Optimal Smoothings of Sublinear Functions and Convex Cones
(available as arXiv preprint) | 2025-01-01 | Paper |
Some New Insights from Highly Optimized Polyhedral Passages
(available as arXiv preprint) | 2025-01-01 | Paper |
Subgame Perfect Methods in Nonsmooth Convex Optimization
(available as arXiv preprint) | 2025-01-01 | Paper |
H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
(available as arXiv preprint) | 2025-01-01 | Paper |
Provably faster gradient descent via long steps
SIAM Journal on Optimization | 2024-07-29 | Paper |
Radial duality. I: Foundations
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Radial duality. II: Applications and algorithms
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
On optimal universal first-order methods for minimizing heterogeneous sums
Optimization Letters | 2024-03-11 | Paper |
A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
(available as arXiv preprint) | 2024-01-01 | Paper |
Performance Estimation for Smooth and Strongly Convex Sets
(available as arXiv preprint) | 2024-01-01 | Paper |
Composing Optimized Stepsize Schedules for Gradient Descent
(available as arXiv preprint) | 2024-01-01 | Paper |
Beyond Minimax Optimality: A Subgame Perfect Gradient Method
(available as arXiv preprint) | 2024-01-01 | Paper |
Some Unified Theory for Variance Reduced Prox-Linear Methods
(available as arXiv preprint) | 2024-01-01 | Paper |
| Goldstein Stationarity in Lipschitz Constrained Optimization | 2023-10-05 | Paper |
| Accelerated Gradient Descent via Long Steps | 2023-09-18 | Paper |
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
Mathematical Programming. Series A. Series B | 2023-08-01 | Paper |
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
SIAM Journal on Optimization | 2023-07-12 | Paper |
Optimal Convergence Rates for the Proximal Bundle Method
SIAM Journal on Optimization | 2023-06-07 | Paper |
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
Journal of Optimization Theory and Applications | 2023-04-17 | Paper |
A simple nearly optimal restart scheme for speeding up first-order methods
Foundations of Computational Mathematics | 2023-04-14 | Paper |
Accelerated Gradient Descent via Long Steps
(available as arXiv preprint) | 2023-01-01 | Paper |
| On the Linear Convergence of Extra-Gradient Methods for Nonconvex-Nonconcave Minimax Problems | 2022-01-16 | Paper |
On the Linear Convergence of Extra-Gradient Methods for Nonconvex-Nonconcave Minimax Problems
(available as arXiv preprint) | 2022-01-01 | Paper |
General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds
(available as arXiv preprint) | 2021-04-20 | Paper |
Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
SIAM Journal on Optimization | 2019-08-27 | Paper |
Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
SIAM Journal on Optimization | 2019-08-27 | Paper |
| General Convergence Rates Follow From Specialized Rates Assuming Growth Bounds | 2019-05-15 | Paper |
General Convergence Rates Follow From Specialized Rates Assuming Growth Bounds
(available as arXiv preprint) | 2019-01-01 | Paper |
Dual-based approximation algorithms for cut-based network connectivity problems
Algorithmica | 2018-07-26 | Paper |
Radial subgradient method
SIAM Journal on Optimization | 2018-03-09 | Paper |
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods
(available as arXiv preprint) | 2018-02-28 | Paper |
Improved approximation algorithms for single-tiered relay placement
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
