Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
Yuxin Chen
,
Emmanuel J. Candès
Type:
Preprint
Publication Date:
2015-05-19
Citations:
160
Share
Similar Works
Action
Title
Year
Authors
+
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
2015
Yuxin Chen
Emmanuel J. Candès
+
PDF
Chat
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
2016
Yuxin Chen
Emmanuel J. Candès
+
Computational Methods for Linear-Quadratic Optimization
1999
Peter Benner
+
PDF
Chat
When a system of real quadratic equations has a solution
2022
Alexander Barvinok
Mark Rudelson
+
When a system of real quadratic equations has a solution
2021
Alexander Barvinok
Mark Rudelson
+
Solving (Almost) all Systems of Random Quadratic Equations
2017
Gang Wang
Georgios B. Giannakis
Yousef Saad
Jie Chen
+
Solving overparametrized systems of random equations: I. Model and algorithms for approximate solutions
2023
Andrea Montanari
Eliran Subag
+
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
2016
Gang Wang
Georgios B. Giannakis
Yonina C. Eldar
+
OPTIMIZATION FOR SPARSE SYSTEMS
1976
Thomas L. Magnanti
+
Random linear-quadratic mathematical models: Computing explicit solutions and applications
2008
J.âC. CortĂŠs
L. JĂłdar
L. Villafuerte
+
Sparse solutions to random standard quadratic optimization problems
2012
Xin Chen
Jiming Peng
Shuzhong Zhang
+
Linear, quadratic, and geometric models
2018
Giuseppe C. Calafiore
Laurent El Ghaoui
+
Sparse Polynomial Optimization: Theory and Practice
2022
Victor Magron
Jie Wang
+
Sparse Matrix Methods in Optimization.
1982
Philip E. Gill
Walter Murray
Michael A. Saunders
Margaret H. Wright
+
Matrix free methods for large scale optimization
2015
Jiashan Wang
+
The local convexity of solving systems of quadratic equations
2015
Chris D. White
Sujay Sanghavi
Rachel Ward
+
The local convexity of solving systems of quadratic equations
2015
Chris D. White
Sujay Sanghavi
Rachel Ward
+
PDF
Chat
Solving A System Of Linear Equations By Randomized Orthogonal Projections
2021
Alireza Entezari
Arunava Banerjee
Leila Kalantari
+
Solving A System Of Linear Equations By Randomized Orthogonal Projections
2021
Alireza Entezari
Arunava Banerjee
Leila Kalantari
+
Under-determined linear systems and $\ell_q$-optimization thresholds
2013
Mihailo Stojnic
Works That Cite This (130)
Action
Title
Year
Authors
+
BranchHull: Convex bilinear inversion from the entrywise product of signals with known signs
2019
Alireza Aghasi
Ali Ahmed
Paul Hand
Babhru Joshi
+
The Landscape of Empirical Risk for Non-convex Losses
2016
Mei Song
Yu Bai
Andrea Montanari
+
PDF
Chat
Conic optimization for control, energy systems, and machine learning: Applications and algorithms
2018
Richard Y. Zhang
CĂŠdric Josz
Somayeh Sojoudi
+
The Global Optimization Geometry of Low-Rank Matrix Optimization
2021
Zhihui Zhu
Qiuwei Li
Gongguo Tang
Michael B. Wakin
+
PDF
Chat
Positive Semidefinite Matrix Factorization Based on Truncated Wirtinger Flow
2020
Dana Lahat
CĂŠdric FĂŠvotte
+
First-Order Methods for Fast Feasibility Pursuit of Non-convex QCQPs
2017
Aritra Konar
Nicholas D. Sidiropoulos
+
Hessian Eigenspectra of More Realistic Nonlinear Models
2021
Zhenyu Liao
Michael W. Mahoney
+
Generalized Hessian approximations via Stein's lemma for constrained minimization
2017
Murat A. Erdogdu
+
Empirical Chaos Processes and Blind Deconvolution
2016
Ali Ahmed
Felix Krahmer
Justin Romberg
+
Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
2021
Puya Latafat
Andreas Themelis
Masoud Ahookhosh
Panagiotis Patrinos
Works Cited by This (14)
Action
Title
Year
Authors
+
The local convexity of solving systems of quadratic equations
2015
Chris D. White
Sujay Sanghavi
Rachel Ward
+
A nonconvex regularized approach for phase retrieval
2014
Audrey Repetti
Ămilie Chouzenoux
JeanâChristophe Pesquet
+
When Are Nonconvex Problems Not Scary?
2015
Ju Sun
Qing Qu
John Wright
+
Guaranteed Matrix Completion via Non-Convex Factorization
2016
Ruoyu Sun
ZhiâQuan Luo
+
Low rank matrix recovery from rank one measurements
2014
Richard Kueng
Holger Rauhut
Ulrich Terstiege
+
Alternating projection, ptychographic imaging and phase synchronization
2015
Stefano Marchesini
Yu-Chao Tu
HauâTieng Wu
+
Simple, Efficient, and Neural Algorithms for Sparse Coding
2015
Sanjeev Arora
Rong Ge
Tengyu Ma
Ankur Moitra
+
Fast matrix completion without the condition number
2014
Moritz Hardt
Mary Wootters
+
Phase recovery, MaxCut and complex semidefinite programming
2013
Irène Waldspurger
Alexandre dâAspremont
StĂŠphane Mallat
+
Phase Retrieval using Alternating Minimization
2013
Praneeth Netrapalli
Prateek Jain
Sujay Sanghavi