77 citations · 318 across the 57 of their papers we have counts for
6 papers · 1 filter
Sweeping by a tame process
Aris Daniilidis, Dmitriy Drusvyatskiy
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold m…
Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier
Dmitriy Drusvyatskiy, Nathan Krislock, Yuen-Lam Voronin +1
We present two algorithms for large-scale low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in…
Projection methods in quantum information science
Yuen-Lam Cheung, Dmitriy Drusvyatskiy, Chi-Kwong Li +2
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states to another such set $\{\ha…
Coordinate shadows of semi-definite and Euclidean distance matrices
D. Drusvyatskiy, G. Pataki, H. Wolkowicz
We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definit…
Extreme point inequalities and geometry of the rank sparsity ball
D. Drusvyatskiy, S. A. Vavasis, H. Wolkowicz
We investigate geometric features of the unit ball corresponding to the sum of the nuclear norm of a matrix and the norm of its entries --- a common penalty function encourag…
Transversality and alternating projections for nonconvex sets
D. Drusvyatskiy, A. D. Ioffe, A. 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 conditio…