Dmitriy Drusvyatskiy
Dmitriy Drusvyatskiy
Verified email at - Homepage
TitleCited byYear
Error bounds, quadratic growth, and linear convergence of proximal methods
D Drusvyatskiy, AS Lewis
Mathematics of Operations Research 43 (3), 919-948, 2018
Transversality and alternating projections for nonconvex sets
D Drusvyatskiy, AD Ioffe, AS Lewis
Foundations of Computational Mathematics 15 (6), 1637-1651, 2015
Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
D Drusvyatskiy, AS Lewis
SIAM Journal on Optimization 23 (1), 256-267, 2013
Stochastic model-based minimization of weakly convex functions
D Davis, D Drusvyatskiy
SIAM Journal on Optimization 29 (1), 207–239, 2018
Efficiency of minimizing compositions of convex functions and smooth maps
D Drusvyatskiy, C Paquette
Mathematical Programming 178 (1-2), 503-558, 2019
Second-order growth, tilt stability, and metric regularity of the subdifferential
D Drusvyatskiy, BS Mordukhovich, TTA Nghia
arXiv preprint arXiv:1304.7385, 2013
Catalyst for gradient-based nonconvex optimization
C Paquette, H Lin, D Drusvyatskiy, J Mairal, Z Harchaoui
Orthogonal invariance and identifiability
A Daniilidis, D Drusvyatskiy, AS Lewis
SIAM Journal on Matrix Analysis and Applications 35 (2), 580-598, 2014
An optimal first order method based on optimal quadratic averaging
D Drusvyatskiy, M Fazel, S Roy
SIAM Journal on Optimization 28 (1), 251-271, 2018
Coordinate shadows of semidefinite and Euclidean distance matrices
D Drusvyatskiy, G Pataki, H Wolkowicz
SIAM Journal on Optimization 25 (2), 1160-1178, 2015
Level-set methods for convex optimization
AY Aravkin, JV Burke, D Drusvyatskiy, MP Friedlander, S Roy
Mathematical Programming 174 (1-2), 359-390, 2019
The nonsmooth landscape of phase retrieval
D Davis, D Drusvyatskiy, C Paquette
arXiv preprint arXiv:1711.03247, 2017
Stochastic subgradient method converges on tame functions
D Davis, D Drusvyatskiy, S Kakade, JD Lee
Foundations of Computational Mathematics, 1-36, 2018
Nonsmooth optimization using taylor-like models: error bounds, convergence, and termination criteria
D Drusvyatskiy, AD Ioffe, AS Lewis
arXiv preprint arXiv:1610.03446, 2016
Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier
D Drusvyatskiy, N Krislock, YL Voronin, H Wolkowicz
SIAM Journal on Optimization 27 (4), 2301-2331, 2017
Quadratic growth and critical point stability of semi-algebraic functions
D Drusvyatskiy, AD Ioffe
Mathematical Programming 153 (2), 635-653, 2015
The many faces of degeneracy in conic optimization
D Drusvyatskiy, H Wolkowicz
Foundations and TrendsŪ in Optimization 3 (2), 77-170, 2017
The proximal point method revisited
D Drusvyatskiy
arXiv preprint arXiv:1712.06038, 2017
Subgradient methods for sharp weakly convex functions
D Davis, D Drusvyatskiy, KJ MacPhee, C Paquette
Journal of Optimization Theory and Applications 179 (3), 962-982, 2018
Optimality, identifiability, and sensitivity
D Drusvyatskiy, AS Lewis
Mathematical Programming 147 (1-2), 467-498, 2014
The system can't perform the operation now. Try again later.
Articles 1–20