2013
DOI: 10.1007/s00041-013-9305-2
|View full text |Cite
|
Sign up to set email alerts
|

Stable Optimizationless Recovery from Phaseless Linear Measurements

Abstract: We address the problem of recovering an n-vector from m linear measurements lacking sign or phase information. We show that lifting and semidefinite relaxation suffice by themselves for stable recovery in the setting of m = O(n log n) random sensing vectors, with high probability. The recovery method is optimizationless in the sense that trace minimization in the PhaseLift procedure is unnecessary. That is, PhaseLift reduces to a feasibility problem. The optimizationless perspective allows for a Douglas-Rachfo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

6
158
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 114 publications
(164 citation statements)
references
References 24 publications
6
158
0
Order By: Relevance
“…The original requirement of m = O(n log(n)) vectors has been relaxed to m = O(n) in [15]. Similar convex optimization solutions have been proposed by the authors of [20] and [34]. Additionally, [23] studied the duality gap in this approach and obtained a necessary and sufficient condition for the existence of a dual certificate.…”
Section: Introductionmentioning
confidence: 98%
“…The original requirement of m = O(n log(n)) vectors has been relaxed to m = O(n) in [15]. Similar convex optimization solutions have been proposed by the authors of [20] and [34]. Additionally, [23] studied the duality gap in this approach and obtained a necessary and sufficient condition for the existence of a dual certificate.…”
Section: Introductionmentioning
confidence: 98%
“…Matching oscillations pointwise generically runs into the cycle-skipping problem. Lack of convexity is also found in phase-retrieval problems (Demanet and Hand, 2014;Gholami, 2014), although in a less severe form.…”
Section: Methods Cost Function and Its Gradientmentioning
confidence: 88%
“…It also implies that we must deal with a highly underdetermined problem since for the PL procedure, there are N 2 unknowns (instead of only N ) for M = O(N ) magnitude measurements. As explained in [21], this apparent lack of data is compensated by the fact that we are only looking for rank one matrices. It is also worth noting that the computational complexity of the PC algorithm (11) is higher than the one of PL (6) since we are looking in the space of Hermitian matrices of dimension M for PC instead of only N for PL.…”
Section: Discussionmentioning
confidence: 99%