| Publication | Date of Publication | Type |
|---|
Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization
Foundations of Computational Mathematics | 2026-05-08 | Paper |
Counting partial Hadamard matrices in the cubic regime
(available as arXiv preprint) | 2026-01-01 | Paper |
The sharp one-dimensional convex sub-Gaussian comparison constant
(available as arXiv preprint) | 2026-01-01 | Paper |
Forbidden subgraphs in divisor graphs and an Erdős divisibility problem
(available as arXiv preprint) | 2026-01-01 | Paper |
A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
Foundations of Computational Mathematics | 2025-06-02 | Paper |
Clustering a mixture of Gaussians with unknown covariance
Bernoulli | 2025-05-27 | Paper |
Global optimality of the EM algorithm for mixtures of two-component linear regressions
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Stochastic optimization over proximally smooth sets
SIAM Journal on Optimization | 2025-01-14 | Paper |
Spectral norm bound for the product of random Fourier-Walsh matrices
(available as arXiv preprint) | 2025-01-01 | Paper |
A superlinearly convergent subgradient method for sharp semismooth problems
Mathematics of Operations Research | 2024-11-07 | Paper |
Asymptotic normality and optimality in nonsmooth stochastic approximation
The Annals of Statistics | 2024-10-18 | Paper |
Stochastic algorithms with geometric step decay converge linearly on sharp functions
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Special issue: International symposium on mathematical programming 2022
Mathematical Programming. Series A. Series B | 2023-06-23 | Paper |
| A linearly convergent Gauss-Newton subgradient method for ill-conditioned problems | 2022-12-26 | Paper |
| A nearly linearly convergent first-order method for nonsmooth functions with quadratic growth | 2022-04-29 | Paper |
| A superlinearly convergent subgradient method for sharp semismooth problems | 2022-01-12 | Paper |
A linearly convergent Gauss-Newton subgradient method for ill-conditioned problems
(available as arXiv preprint) | 2022-01-01 | Paper |
| A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions | 2021-12-13 | Paper |
Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
(available as arXiv preprint) | 2021-06-17 | Paper |
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions
(available as arXiv preprint) | 2021-01-01 | Paper |
| Stochastic optimization over proximally smooth sets | 2020-02-14 | Paper |
From low probability to high confidence in stochastic convex optimization
(available as arXiv preprint) | 2019-07-31 | Paper |
| Complexity of finding near-stationary points of convex functions stochastically | 2018-02-21 | Paper |
Complexity of finding near-stationary points of convex functions stochastically
(available as arXiv preprint) | 2018-01-01 | Paper |
| The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM | 2016-06-07 | Paper |
| The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems | 2016-04-02 | Paper |
| SMART: The Stochastic Monotone Aggregated Root-Finding Algorithm | 2016-01-04 | Paper |
SMART: The Stochastic Monotone Aggregated Root-Finding Algorithm
(available as arXiv preprint) | 2016-01-01 | Paper |
The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems
(available as arXiv preprint) | 2016-01-01 | Paper |
The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM
(available as arXiv preprint) | 2016-01-01 | Paper |
