Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

05/19/2015
by   Yuxin Chen, et al.
0

We consider the fundamental problem of solving quadratic systems of equations in n variables, where y_i = |〈a_i, x〉|^2, i = 1, ..., m and x∈R^n is unknown. We propose a novel method, which starting with an initial guess computed by means of a spectral method, proceeds by minimizing a nonconvex functional as in the Wirtinger flow approach. There are several key distinguishing features, most notably, a distinct objective functional and novel update rules, which operate in an adaptive fashion and drop terms bearing too much influence on the search direction. These careful selection rules provide a tighter initial guess, better descent directions, and thus enhanced practical performance. On the theoretical side, we prove that for certain unstructured models of quadratic systems, our algorithms return the correct solution in linear time, i.e. in time proportional to reading the data {a_i} and {y_i} as soon as the ratio m/n between the number of equations and unknowns exceeds a fixed numerical constant. We extend the theory to deal with noisy systems in which we only have y_i ≈ |〈a_i, x〉|^2 and prove that our algorithms achieve a statistical accuracy, which is nearly un-improvable. We complement our theoretical study with numerical examples showing that solving random quadratic systems is both computationally and statistically not much harder than solving linear systems of the same size---hence the title of this paper. For instance, we demonstrate empirically that the computational cost of our algorithm is about four times that of solving a least-squares problem of the same size.

READ FULL TEXT
research
05/22/2019

Solving Random Systems of Quadratic Equations with Tanh Wirtinger Flow

Solving quadratic systems of equations in n variables and m measurements...
research
05/08/2017

Hardness Results for Structured Linear Systems

We show that if the nearly-linear time solvers for Laplacian matrices an...
research
05/29/2017

Solving Almost all Systems of Random Quadratic Equations

This paper deals with finding an n-dimensional solution x to a system of...
research
07/20/2019

The Generalized Trust Region Subproblem: solution complexity and convex hull results

We consider the Generalized Trust Region Subproblem (GTRS) of minimizing...
research
07/15/2023

A Nearly-Linear Time Algorithm for Structured Support Vector Machines

Quadratic programming is a fundamental problem in the field of convex op...
research
04/02/2018

Constrained Least Squares for Extended Complex Factor Analysis

For subspace estimation with an unknown colored noise, Factor Analysis (...
research
05/19/2016

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems

Bézout 's theorem states that dense generic systems of n multivariate qu...

Please sign up or login with your details

Forgot password? Click here to reset