Just relax: convex programming methods for identifying sparse signals in noise

DOI10.1109/TIT.2005.864420zbMATH Open1288.94025DBLPjournals/tit/Tropp06WikidataQ59750791 ScholiaQ59750791MaRDI QIDQ3547718FDOQ3547718

Authors: Joel A. Tropp 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Templates for convex cone problems with applications to sparse signal recovery
• Stable signal recovery from incomplete and inaccurate measurements
• On sparse reconstruction from Fourier and Gaussian measurements
• Stable recovery of sparse overcomplete representations in the presence of noise

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Cited In (only showing first 100 items - show all)

• Multi-layer sparse coding: the holistic way
• Spectral dynamics and regularization of incompletely and irregularly measured data
• On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
• Minimizers of sparsity regularized Huber loss function
• Sorted concave penalized regression
• Sparse approximate solution of partial differential equations
• IDENT: identifying differential equations with numerical time evolution
• Limited-complexity controller tuning: a set membership data-driven approach
• Using the eigenvalue relaxation for binary least-squares estimation problems
• Control of MIMO nonlinear systems: a data-driven model inversion approach
• A performance guarantee for orthogonal matching pursuit using mutual coherence
• Signal recovery under cumulative coherence
• Robust sparse recovery via a novel convex model
• Nonlinear system identification in Sobolev spaces
• Foundations of gauge and perspective duality
• Low complexity regularization of linear inverse problems
• Proximal mapping for symmetric penalty and sparsity
• Beyond canonical dc-optimization: the single reverse polar problem
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• When do stepwise algorithms meet subset selection criteria?
• Sparse set membership identification of nonlinear functions and application to fault detection
• Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
• Alternating direction method of multipliers for solving dictionary learning models
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
• SONIC: social network analysis with influencers and communities
• Stable restoration and separation of approximately sparse signals
• Relaxed maximum a posteriori fault identification
• Average performance of the approximation in a dictionary using an \(\ell _0\) objective
• Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
• When is there a representer theorem? Reflexive Banach spaces
• A CS recovery algorithm for model and time delay identification of MISO-FIR systems
• Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
• Optimal dual certificates for noise robustness bounds in compressive sensing
• Second-order Stein: SURE for SURE and other applications in high-dimensional inference
• Resolution analysis of imaging with \(\ell_1\) optimization
• Book Review: A mathematical introduction to compressive sensing
• TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration
• Signal enhancement and the method of successive projections
• Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
• Registration-based compensation using sparse representation in conformal-array STAP
• Piecewise-polynomial signal segmentation using convex optimization.
• Theoretical guarantees for graph sparse coding
• Statistical optimization in high dimensions
• Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model
• On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
• Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
• Compressed sensing with structured sparsity and structured acquisition
• On reconstructing functions from binary measurements
• Structured iterative hard thresholding with on- and off-grid applications
• Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty
• Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
• Consistency of \(\ell_1\) recovery from noisy deterministic measurements
• Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model
• Duality and Convex Programming
• Average Performance of the Sparsest Approximation Using a General Dictionary
• Sparse Bayesian imaging of solar flares
• Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
• On stepwise pattern recovery of the fused Lasso
• Fixed point and Bregman iterative methods for matrix rank minimization
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Non-convex sparse regularisation
• Model-based multiple rigid object detection and registration in unstructured range data
• On the informativity of direct identification experiments in dynamical networks
• Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
• A semidefinite programming study of the Elfving theorem
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
• On the convergence of the SINDy algorithm
• Iterative thresholding for sparse approximations
• High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
• Convolutional neural networks analyzed via convolutional sparse coding
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Towards a Mathematical Theory of Super‐resolution
• Proximal splitting methods in signal processing
• Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
• The residual method for regularizing ill-posed problems
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Mixed linear system estimation and identification
• Disparity and optical flow partitioning using extended Potts priors
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• Two are better than one: fundamental parameters of frame coherence
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach
• A numerical exploration of compressed sampling recovery
• An adaptive inverse scale space method for compressed sensing
• Matrix sparsification and the sparse null space problem
• Inferring stable genetic networks from steady-state data
• Sparse reconstruction with multiple Walsh matrices
• Sparsity- and continuity-promoting seismic image recovery with curvelet frames
• Optimal identification experiment design for LPV systems using the local approach
• Nearly unbiased variable selection under minimax concave penalty
• Regularized learning in Banach spaces as an optimization problem: representer theorems
• A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
• Adaptive algorithms for sparse system identification
• A unified approach to model selection and sparse recovery using regularized least squares
• Linearized Bregman iterations for compressed sensing
• On the conditioning of random subdictionaries

This page was built for publication: Just relax: convex programming methods for identifying sparse signals in noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547718)