| Publication | Date of Publication | Type |
|---|
On semidefinite descriptions for convex hulls of quadratic programs
(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 |
Sharpness and conditioning of nonsmooth convex formulations in statistical signal recovery
SIAM Journal on Optimization | 2026-07-14 | Paper |
Implicit Primal-Dual Guarantees in Unconstrained First-Order Minimization
(available as arXiv preprint) | 2026-01-01 | Paper |
A Unified Theory of H-Duality in First-Order Methods
(available as arXiv preprint) | 2026-01-01 | Paper |
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
Mathematical Programming. Series A. Series B | 2025-07-08 | Paper |
Hidden convexity, optimization, and algorithms on rotation matrices
Mathematics of Operations Research | 2025-06-02 | Paper |
On semidefinite descriptions for convex hulls of quadratic programs
Operations Research Letters | 2025-05-03 | Paper |
Accelerated first-order methods for a class of semidefinite programs
Mathematical Programming. Series A. Series B | 2025-01-17 | Paper |
Subgame Perfect Methods in Nonsmooth Convex Optimization
(available as arXiv preprint) | 2025-01-01 | Paper |
Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
(available as arXiv preprint) | 2025-01-01 | Paper |
Necessary and Sufficient Conditions for Rank-One-Generated Cones
Mathematics of Operations Research | 2024-02-23 | Paper |
A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
(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 |
| Accelerated Gradient Descent via Long Steps | 2023-09-18 | Paper |
| Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery | 2023-07-13 | Paper |
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
SIAM Journal on Optimization | 2023-07-12 | Paper |
| Hidden convexity, optimization, and algorithms on rotation matrices | 2023-04-17 | Paper |
scientific article; zbMATH DE number 7650075 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery
(available as arXiv preprint) | 2023-01-01 | Paper |
Accelerated Gradient Descent via Long Steps
(available as arXiv preprint) | 2023-01-01 | Paper |
On Convex Hulls of Epigraphs of QCQPs
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| Solving Stackelberg Prediction Game with Least Squares Loss via Spherically Constrained Least Squares Reformulation | 2022-06-06 | Paper |
On the tightness of SDP relaxations of QCQPs
Mathematical Programming. Series A. Series B | 2022-04-29 | Paper |
The generalized trust region subproblem: solution complexity and convex hull results
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Solving Stackelberg Prediction Game with Least Squares Loss via Spherically Constrained Least Squares Reformulation
(available as arXiv preprint) | 2022-01-01 | Paper |
| Exactness in SDP relaxations of QCQPs: Theory and applications | 2021-07-14 | Paper |
| New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs | 2021-01-28 | Paper |
Exactness in SDP relaxations of QCQPs: Theory and applications
(available as arXiv preprint) | 2021-01-01 | Paper |
| A Geometric View of SDP Exactness in QCQPs and its Applications | 2020-11-13 | Paper |
A Geometric View of SDP Exactness in QCQPs and its Applications
(available as arXiv preprint) | 2020-01-01 | Paper |
