Solving Complex Quadratic Systems with Full-Rank Random Matrices

by   Shuai Huang, et al.

We tackle the problem of recovering a complex signal x∈C^n from quadratic measurements of the form y_i= x^* A_i x, where { A_i}_i=1^m is a set of full-rank, complex random matrices with rotation invariant entries. This non-convex problem is related to the well understood phase retrieval problem where A_i is a rank-1 positive semidefinite matrix. Here we study the general full-rank case which models a number of key applications such as molecular geometry recovery from distance distributions and compound measurements in phaseless diffractive imaging. Most prior work tackles specific measurement models and either addresses the rank-1 case or focuses on real measurements. The several papers that address the full-rank complex case adopt the computationally-demanding semidefinite relaxation approach. In this paper we prove that the general class of rotation invariant measurement models can be efficiently solved with high probability via the standard framework comprising a spectral initialization followed by iterative gradient descent updates. Numerical experiments on simulated data generated from the rotation invariant exponential family corroborate our theoretical analysis and provide insights in designing suitable measurement matrices.


page 1

page 2

page 3

page 4


The recovery of complex sparse signals from few phaseless measurements

We study the stable recovery of complex k-sparse signals from as few pha...

The local convexity of solving systems of quadratic equations

This paper considers the recovery of a rank r positive semidefinite matr...

A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements

We propose a simple, scalable, and fast gradient descent algorithm to op...

Solving Systems of Quadratic Equations via Exponential-type Gradient Descent Algorithm

We consider the rank minimization problem from quadratic measurements, i...

Solving Quadratic Systems with Full-Rank Matrices Using Sparse or Generative Priors

The problem of recovering a signal x∈ℝ^n from a quadratic system {y_i=x^...

Rigorous Analysis of Spectral Methods for Random Orthogonal Matrices

Phase retrieval refers to algorithmic methods for recovering a signal fr...

Blind Deconvolutional Phase Retrieval via Convex Programming

We consider the task of recovering two real or complex m-vectors from ph...

Please sign up or login with your details

Forgot password? Click here to reset