Dmitriy Drusvyatskiy
University of Washington
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Dmitriy Drusvyatskiy.
Siam Journal on Optimization | 2013
Dmitriy Drusvyatskiy; Adrian S. Lewis
We prove that uniform second-order growth, tilt stability, and strong metric regularity of the subdifferential---three notions that have appeared in entirely different settings---are all essentially equivalent for any lower-semicontinuous, extended real-valued function.
Foundations of Computational Mathematics | 2015
Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear convergence. When the two sets are semi-algebraic and bounded, but not necessarily transversal, we nonetheless prove subsequence convergence.
Mathematical Programming | 2018
Dmitriy Drusvyatskiy; Courtney Paquette
We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration solves a regularized subproblem formed by linearizing the smooth map. When the subproblems are solved exactly, the method has efficiency
SIAM Journal on Matrix Analysis and Applications | 2014
Aris Daniilidis; Dmitriy Drusvyatskiy; Adrian S. Lewis
Siam Journal on Optimization | 2015
Dmitriy Drusvyatskiy; Gábor Pataki; Henry Wolkowicz
\mathcal {O}(\varepsilon ^{-2})
Mathematical Programming | 2015
Dmitriy Drusvyatskiy; Alexander D. Ioffe
Mathematical Programming | 2013
Dmitriy Drusvyatskiy; Adrian S. Lewis
O(ε-2), akin to gradient descent for smooth minimization. We show that when the subproblems can only be solved by first-order methods, a simple combination of smoothing, the prox-linear method, and a fast-gradient scheme yields an algorithm with complexity
Siam Journal on Control and Optimization | 2015
Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis
Siam Journal on Optimization | 2018
Dmitriy Drusvyatskiy; Maryam Fazel; Scott Roy
\widetilde{\mathcal {O}}(\varepsilon ^{-3})
arXiv: Optimization and Control | 2010
Dmitriy Drusvyatskiy; Adrian S. Lewis