87 citations · 386 across the 17 of their papers we have counts for
6 papers · 1 filter
Corruption Robust Phase Retrieval via Linear Programming
Paul Hand, Vladislav Voroninski
We consider the problem of phase retrieval from corrupted magnitude observations. In particular we show that a fixed can be recovered exactly from corrupted…
An Elementary Proof of Convex Phase Retrieval in the Natural Parameter Space via the Linear Program PhaseMax
Paul Hand, Vladislav Voroninski
The phase retrieval problem has garnered significant attention since the development of the PhaseLift algorithm, which is a convex program that operates in a lifted space of matric…
Compressed Sensing from Phaseless Gaussian Measurements via Linear Programming in the Natural Parameter Space
Paul Hand, Vladislav Voroninski
We consider faithfully combining phase retrieval with classical compressed sensing. Inspired by the recent novel formulation for phase retrieval called PhaseMax, we present and ana…
ShapeFit and ShapeKick for Robust, Scalable Structure from Motion
Thomas Goldstein, Paul Hand, Choongbum Lee +2
We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence…
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
Nicolas Boumal, Vladislav Voroninski, Afonso S. Bandeira
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and…
On the low-rank approach for semidefinite programs arising in synchronization and community detection
Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski
To address difficult optimization problems, convex relaxations based on semidefinite programming are now common place in many fields. Although solvable in polynomial time, large se…