@Article{JCM-38-638,
author = {Huang , Meng and Xu , Zhiqiang},
title = {Solving Systems of Quadratic Equations via Exponential-Type Gradient Descent Algorithm},
journal = {Journal of Computational Mathematics},
year = {2020},
volume = {38},
number = {4},
pages = {638--660},
abstract = {<p style="text-align: justify;">We consider the rank minimization problem from quadratic measurements, i.e., recovering a rank $r$ matrix $X \in \mathbb{R}^{n×r}$ from $m$ scalar measurements $y_i=a_i^T XX^T a_i,\;a_i\in \mathbb{R}^n,\;i=1,\ldots,m$. Such problem arises in a variety of applications such as quadratic regression and quantum state tomography. We present a novel algorithm, which is termed $exponential-type$ $gradient$ $descent$ $algorithm$, to minimize a non-convex objective function $f(U)=\frac{1}{4m}\sum_{i=1}^m(y_i-a_i^T UU^T a_i)^2$. This&nbsp; algorithm&nbsp; starts with a careful initialization, and then refines this initial guess by iteratively applying exponential-type gradient descent. Particularly,&nbsp; we can obtain a good initial guess of $X$ as long as the number of Gaussian random measurements is&nbsp; $O(nr)$, and&nbsp; our iteration algorithm can converge linearly to the true $X$ (up to an orthogonal matrix) with $m=O\left(nr\log (cr)\right)$ Gaussian random measurements.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1902-m2018-0109},
url = {http://global-sci.org/intro/article_detail/jcm/16467.html}
}