Nonlinear basis pursuit

In compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear systems of equations, called nonlinear basis pursuit. In contrast to the existing nonlinear compressive sensing methods, the new algorithm is based on convex relaxation and is not a greedy method. The novel algorithm enables the compressive sensing approach to be used for a broader range of applications where there are nonlinear relationships between the measurements and the unknowns.

[1]  Yonina C. Eldar,et al.  Phase Retrieval via Matrix Completion , 2011, SIAM Rev..

[2]  S. Marchesini Ab Initio Undersampled Phase Retrieval , 2008, Microscopy and Microanalysis.

[3]  Yonina C. Eldar,et al.  Sparsity-Based Single-Shot Sub-Wavelength Coherent Diffractive Imaging , 2011 .

[4]  Sundeep Rangan,et al.  Compressive phase retrieval via generalized approximate message passing , 2012, Allerton Conference.

[5]  Gitta Kutyniok,et al.  1 . 2 Sparsity : A Reasonable Assumption ? , 2012 .

[6]  Babak Hassibi,et al.  Recovery of sparse 1-D signals from the magnitudes of their Fourier transform , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[7]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1995 .

[8]  Michel Verhaegen,et al.  Quadratic Basis Pursuit , 2013, 1301.7002.

[9]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[10]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[11]  Yonina C. Eldar,et al.  Sparsity Based Sub-wavelength Imaging with Partially Incoherent Light via Quadratic Compressed Sensing References and Links , 2022 .

[12]  Emmanuel J. Candès,et al.  PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming , 2011, ArXiv.

[13]  E.J. Candes Compressive Sampling , 2022 .

[14]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

[15]  LianLin Li,et al.  An Iteratively Reweighted Algorithm for Sparse Reconstruction of Subsurface Flow Properties from Nonlinear Dynamic Data , 2009, ArXiv.

[16]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[17]  S. Sastry,et al.  Compressive Phase Retrieval From Squared Output Measurements Via Semidefinite Programming , 2011, 1111.6323.

[18]  Y. Nesterov Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[19]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[20]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[21]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[22]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[23]  Richard G. Baraniuk,et al.  Compressive phase retrieval , 2007, SPIE Optical Engineering + Applications.

[24]  S. Sastry,et al.  A Review of Fast `1-Minimization Algorithms for Robust Face Recognition , 2010 .

[25]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[26]  Allen Y. Yang,et al.  CPRL -- An Extension of Compressive Sensing to the Phase Retrieval Problem , 2012, NIPS.

[27]  Yonina C. Eldar,et al.  GESPAR: Efficient Phase Retrieval of Sparse Signals , 2013, IEEE Transactions on Signal Processing.

[28]  Allen Y. Yang,et al.  Fast L1-Minimization Algorithms For Robust Face Recognition , 2010, 1007.3753.

[29]  Yonina C. Eldar,et al.  Sparsity-based single-shot sub-wavelength coherent diffractive imaging , 2011, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel.

[30]  Yonina C. Eldar,et al.  Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms , 2012, SIAM J. Optim..

[31]  Mike E. Davies,et al.  Gradient pursuit for non-linear sparse signal modelling , 2008, 2008 16th European Signal Processing Conference.

[32]  G. Papanicolaou,et al.  Array imaging using intensity-only measurements , 2010 .

[33]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[34]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[35]  I. Loris On the performance of algorithms for the minimization of ℓ1-penalized functionals , 2007, 0710.4082.

[36]  M. Er Quadratic optimization problems in robust beamforming , 1990 .

[37]  Thomas Blumensath,et al.  Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems , 2012, IEEE Transactions on Information Theory.

[38]  H. Konno,et al.  A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis , 2002 .

[39]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.