| Publication | Date of Publication | Type |
|---|
Linear recursive feature machines provably recover low-rank matrices
Proceedings of the National Academy of Sciences of the United States of America | 2026-03-13 | Paper |
Stochastic optimization over proximally smooth sets
SIAM Journal on Optimization | 2025-01-14 | Paper |
Flat minima generalize for low-rank matrix recovery
Information and Inference: A Journal of the IMA | 2024-11-14 | 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 |
Stochastic Optimization with Decision-Dependent Distributions
Mathematics of Operations Research | 2024-02-23 | Paper |
The slope robustly determines convex functions
Proceedings of the American Mathematical Society | 2023-09-08 | Paper |
Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
SIAM Journal on Optimization | 2022-08-19 | Paper |
Conservative and semismooth derivatives are equivalent for semialgebraic maps
Set-Valued and Variational Analysis | 2022-06-03 | Paper |
Proximal methods avoid active strict saddles of weakly convex functions
Foundations of Computational Mathematics | 2022-05-31 | Paper |
Graphical convergence of subgradients in nonconvex optimization and learning
Mathematics of Operations Research | 2022-05-17 | Paper |
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Foundations of Computational Mathematics | 2022-01-18 | Paper |
| A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions | 2021-12-13 | Paper |
Composite optimization for robust rank one bilinear sensing
Information and Inference: A Journal of the IMA | 2021-10-13 | Paper |
scientific article; zbMATH DE number 7370566 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370566 (Why is no real title available?) | 2021-07-09 | Paper |
Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
(available as arXiv preprint) | 2021-06-17 | Paper |
The nonsmooth landscape of phase retrieval
IMA Journal of Numerical Analysis | 2021-03-31 | Paper |
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
Pathological subgradient dynamics
SIAM Journal on Optimization | 2020-05-20 | Paper |
Error bounds, quadratic growth, and linear convergence of proximal methods
Mathematics of Operations Research | 2020-03-12 | Paper |
| Stochastic optimization over proximally smooth sets | 2020-02-14 | Paper |
Stochastic subgradient method converges on tame functions
Foundations of Computational Mathematics | 2020-01-31 | Paper |
Local linear convergence for inexact alternating projections on nonconvex sets
Vietnam Journal of Mathematics | 2019-10-23 | Paper |
Efficiency of minimizing compositions of convex functions and smooth maps
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
| Iterative Linearized Control: Stable Algorithms and Complexity Guarantees | 2019-08-20 | Paper |
From low probability to high confidence in stochastic convex optimization
(available as arXiv preprint) | 2019-07-31 | Paper |
Level-set methods for convex optimization
Mathematical Programming. Series A. Series B | 2019-04-24 | Paper |
Stochastic model-based minimization of weakly convex functions
SIAM Journal on Optimization | 2019-02-08 | Paper |
Subgradient methods for sharp weakly convex functions
Journal of Optimization Theory and Applications | 2018-11-27 | Paper |
Sweeping by a tame process
Annales de l’institut Fourier | 2018-11-26 | Paper |
Efficient Quadratic Penalization Through the Partial Minimization Technique
IEEE Transactions on Automatic Control | 2018-09-18 | Paper |
Foundations of gauge and perspective duality
SIAM Journal on Optimization | 2018-09-18 | Paper |
| Variational analysis of spectral functions simplified | 2018-03-27 | Paper |
Variational analysis of spectral functions simplified
(available as arXiv preprint) | 2018-03-27 | Paper |
| Complexity of finding near-stationary points of convex functions stochastically | 2018-02-21 | Paper |
An optimal first order method based on optimal quadratic averaging
SIAM Journal on Optimization | 2018-02-14 | Paper |
| The proximal point method revisited | 2017-12-16 | Paper |
The Euclidean distance degree of orthogonally invariant matrix varieties
Israel Journal of Mathematics | 2017-11-17 | Paper |
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
SIAM Journal on Optimization | 2017-11-03 | Paper |
| The many faces of degeneracy in conic optimization | 2017-06-12 | Paper |
A note on alternating projections for ill-posed semidefinite feasibility problems
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Curves of descent
SIAM Journal on Control and Optimization | 2016-05-31 | Paper |
Generic minimizing behavior in semialgebraic optimization
SIAM Journal on Optimization | 2016-03-02 | Paper |
Transversality and alternating projections for nonconvex sets
Foundations of Computational Mathematics | 2015-12-04 | Paper |
Counting real critical points of the distance to orthogonally invariant matrix sets
SIAM Journal on Matrix Analysis and Applications | 2015-10-19 | Paper |
Quadratic growth and critical point stability of semi-algebraic functions
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Projection methods for quantum channel construction
Quantum Information Processing | 2015-09-23 | Paper |
Extreme point inequalities and geometry of the rank sparsity ball
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Coordinate shadows of semidefinite and Euclidean distance matrices
SIAM Journal on Optimization | 2015-06-24 | Paper |
Clarke subgradients for directionally Lipschitzian stratifiable functions
Mathematics of Operations Research | 2015-05-29 | Paper |
Orbits of geometric descent
Canadian Mathematical Bulletin | 2015-03-23 | Paper |
| Second-order growth, tilt stability, and metric regularity of the subdifferential | 2015-02-27 | Paper |
Second-order growth, tilt stability, and metric regularity of the subdifferential
(available as arXiv preprint) | 2015-02-27 | Paper |
Optimality, identifiability, and sensitivity
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
Orthogonal invariance and identifiability
SIAM Journal on Matrix Analysis and Applications | 2014-10-15 | Paper |
Projection methods in quantum information science
(available as arXiv preprint) | 2014-07-24 | Paper |
Semi-algebraic functions have small subdifferentials
Mathematical Programming. Series A. Series B | 2013-08-12 | Paper |
Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
SIAM Journal on Optimization | 2013-06-27 | Paper |
The dimension of semialgebraic subdifferential graphs
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2011-12-21 | Paper |
| Complexity of a Single Face in an Arrangement of s-Intersecting Curves | 2011-08-22 | Paper |
Generic nondegeneracy in convex optimization
Proceedings of the American Mathematical Society | 2011-08-01 | Paper |
