Fetching the paper…
Reading the bibliography…
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex relaxations.
Projections on convex sets in Hilbert space and spectral theory
E. H. Zarantonello · 1971
Earlier work this paper cites.
Eclatement de contraintes en parallèle pour la minimisation d’une forme quadratique
G. Pierra · 1976
Earlier work this paper cites.
Splitting Algorithms for the Sum of Two Nonlinear Operators
P. L. Lions and B. Mercier · 1979
Earlier work this paper cites.
Applications of the method of multipliers to variational inequalities
D. Gabay · 1983
Earlier work this paper cites.
Decomposition through formalization in a product space
G. Pierra · 1984
Earlier work this paper cites.
Method of successive projections for finding a common point of sets in metric spaces
P. L. Combettes and H. J. Trussell · 1990
Earlier work this paper cites.
On the convergence of von Neumann’s alternating projection algorithm for two sets
H. H. Bauschke and J. M. Borwein · 1993
Earlier work this paper cites.
On projection algorithms for solving convex feasibility problems
H. H. Bauschke and J. M. Borwein · 1996
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J. Wets · 1998
Earlier work this paper cites.
Metric regularity and subdifferential calculus
A. D. Ioffe · 2000
Earlier work this paper cites.
Metric Inequality, Subdifferential Calculus and Applications
H. V. Ngai and M. Théra · 2001
Earlier work this paper cites.
Finding Best Approximation Pairs Relative to Two Closed Convex Sets in Hilbert Spaces
H. H. Bauschke, P. L. Combettes, and D. R. Luke · 2004
Earlier work this paper cites.
Decoding by Linear Programming
E. J. Candès and T. Tao · 2005
Cited alongside, same era.
A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
H. H. Bauschke, P. L. Combettes, and D. R. Luke · 2006
Cited alongside, same era.
About Regularity of Collections of Sets
A. Y. Kruger · 2006
Cited alongside, same era.
Variational Analysis and Generalized Differentiation, I: Basic Theory; II: Applications
B. Mordukhovich · 2006
Cited alongside, same era.
Enhancing sparsity by reweighted ℓ 1 \ell_{1} minimization
E. J. Candès, M. Wakin, and S. Boyd · 2007
Cited alongside, same era.
Finding best approximation pairs relative to a convex and a prox-regular set in a Hilbert space
D. R. Luke · 2008
Phase retrieval via matrix completion
E. J. Candès, Y. Eldar, T. Strohmer, and V. Voroninski · 2011
Later among the works it cites.
An Unconstrained ℓ q \ell_{q} Minimization with 0 < q ≤ 1 0<q\leq 1 for Sparse Solution of Underdetermined Linear Systems
M.-J. Lai and J. Wang · 2011
Later among the works it cites.
Generalized subdifferentials of the rank function
H. Le · 2012
Later among the works it cites.
H. H. Bauschke, J. Y. Bello Cruz, H. M. Phan, and X. Wang · 2013
Closest in time.
Restricted Normal Cones and the Method of Alternating Projections: Applications
H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Iterative hard thresholding for compressed sensing
T. Blumensath and M. Davies · 2009
Cited alongside, same era.
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
A. S. Lewis, D. R. Luke, and J. Malick · 2009
Cited alongside, same era.
Normalised iterative hard thresholding; guaranteed stability and performance
T. Blumensath and M. Davies · 2010
Cited alongside, same era.
Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
B. Jin and D. A. Lorenz · 2010
Cited alongside, same era.
A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
A. Beck and M. Teboulle · 2011
Cited alongside, same era.
Entropic regularization of the ℓ 0 \ell_{0} function
J. M. Borwein and D. R. Luke · 2011
Cited alongside, same era.
H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang · 2013
Closest in time.
Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
R. Hesse and D. R. Luke · 2013
Closest in time.
When only global optimization matters
J.-B. Hiriart-Urruty · 2013
Closest in time.
Prox-Regularity of Rank Constraint Sets and Implications for Algorithms
D. Luke · 2013
Closest in time.
Restricted normal cones and sparsity optimization with affine constraints
H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang · 2014
Closest in time.
Matrix recipes for hard thresholding methods
A. Kyrillidis and V. Cevher · 2014
Closest in time.
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
A. Tillmann and M. E. Pfetsch · 2014
Closest in time.