| Publication | Date of Publication | Type |
|---|
| Stochastic optimization over proximally smooth sets | 2025-01-14 | Paper |
| Flat minima generalize for low-rank matrix recovery | 2024-11-14 | Paper |
| Asymptotic normality and optimality in nonsmooth stochastic approximation | 2024-10-18 | Paper |
| Stochastic algorithms with geometric step decay converge linearly on sharp functions | 2024-09-19 | Paper |
| Stochastic Optimization with Decision-Dependent Distributions | 2024-02-23 | Paper |
| The slope robustly determines convex functions | 2023-09-08 | Paper |
| Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization | 2022-08-19 | Paper |
| Conservative and semismooth derivatives are equivalent for semialgebraic maps | 2022-06-03 | Paper |
| Proximal methods avoid active strict saddles of weakly convex functions | 2022-05-31 | Paper |
| Graphical Convergence of Subgradients in Nonconvex Optimization and Learning | 2022-05-17 | Paper |
| Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence | 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 | 2021-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998940 | 2021-07-09 | Paper |
| Escaping strict saddle points of the Moreau envelope in nonsmooth optimization | 2021-06-17 | Paper |
| The nonsmooth landscape of phase retrieval | 2021-03-31 | Paper |
| Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria | 2021-01-25 | Paper |
| Pathological Subgradient Dynamics | 2020-05-20 | Paper |
| Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods | 2020-03-12 | Paper |
| Stochastic optimization over proximally smooth sets | 2020-02-14 | Paper |
| Stochastic subgradient method converges on tame functions | 2020-01-31 | Paper |
| Local linear convergence for inexact alternating projections on nonconvex sets | 2019-10-23 | Paper |
| Efficiency of minimizing compositions of convex functions and smooth maps | 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 | 2019-07-31 | Paper |
| Level-set methods for convex optimization | 2019-04-24 | Paper |
| Stochastic Model-Based Minimization of Weakly Convex Functions | 2019-02-08 | Paper |
| Subgradient methods for sharp weakly convex functions | 2018-11-27 | Paper |
| Sweeping by a tame process | 2018-11-26 | Paper |
| Efficient Quadratic Penalization Through the Partial Minimization Technique | 2018-09-18 | Paper |
| Foundations of Gauge and Perspective Duality | 2018-09-18 | Paper |
| Variational analysis of spectral functions simplified | 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 | 2018-02-14 | Paper |
| The proximal point method revisited | 2017-12-16 | Paper |
| The Euclidean distance degree of orthogonally invariant matrix varieties | 2017-11-17 | Paper |
| Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier | 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 | 2017-03-23 | Paper |
| Curves of descent | 2016-05-31 | Paper |
| Generic minimizing behavior in semialgebraic optimization | 2016-03-02 | Paper |
| Transversality and alternating projections for nonconvex sets | 2015-12-04 | Paper |
| Counting Real Critical Points of the Distance to Orthogonally Invariant Matrix Sets | 2015-10-19 | Paper |
| Quadratic growth and critical point stability of semi-algebraic functions | 2015-10-19 | Paper |
| Projection methods for quantum channel construction | 2015-09-23 | Paper |
| Extreme point inequalities and geometry of the rank sparsity ball | 2015-08-31 | Paper |
| Coordinate Shadows of Semidefinite and Euclidean Distance Matrices | 2015-06-24 | Paper |
| Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions | 2015-05-29 | Paper |
| Orbits of Geometric Descent | 2015-03-23 | Paper |
| Second-order growth, tilt stability, and metric regularity of the subdifferential | 2015-02-27 | Paper |
| Optimality, identifiability, and sensitivity | 2014-10-17 | Paper |
| Orthogonal invariance and identifiability | 2014-10-15 | Paper |
| Projection methods in quantum information science | 2014-07-24 | Paper |
| Semi-algebraic functions have small subdifferentials | 2013-08-12 | Paper |
| Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential | 2013-06-27 | Paper |
| The dimension of semialgebraic subdifferential graphs | 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 | 2011-08-01 | Paper |
