The local convexity of solving systems of quadratic equations

DOI10.1007/s00025-016-0564-5zbMath1383.65064arXiv1506.07868OpenAlexW2963945345MaRDI QIDQ2410810

Sujay Sanghavi, Rachel Ward, Chris D. White

Publication date: 19 October 2017

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.07868

zbMATH Keywords

nonconvex optimization problemsquadratic equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)

Related Items

Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery, Almost everywhere injectivity conditions for the matrix recovery problem, Guarantees of Riemannian optimization for low rank matrix completion, On global convergence of gradient descent algorithms for generalized phase retrieval problem, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, A geometric analysis of phase retrieval, Low-Rank Spectral Optimization via Gauge Duality, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Generalized phase retrieval: measurement number, matrix recovery and beyond, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, Unnamed Item

Uses Software

• PhaseLift
• Wirtinger Flow

Cites Work

• Low rank matrix recovery from rank one measurements
• Stable optimizationless recovery from phaseless linear measurements
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• User-friendly tail bounds for sums of random matrices
• A predictor-corrector algorithm for the coupling of stiff ODEs to a particle population balance
• Painless reconstruction from magnitudes of frame coefficients
• An inequality for tail probabilities of martingales with differences bounded from one side
• Phase retrieval: stability and recovery guarantees
• On signal reconstruction without phase
• Phase recovery, MaxCut and complex semidefinite programming
• A generalized solution of the orthogonal Procrustes problem
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Phase Retrieval with Polarization
• Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
• Array imaging using intensity-only measurements
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Complex wave-field reconstruction using phase-space tomography
• A useful variant of the Davis–Kahan theorem for statisticians
• Low-rank matrix completion using alternating minimization
• Phase Retrieval via Matrix Completion
• Compressed sensing