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
• In defense of the indefensible: a very naïve approach to high-dimensional inference
• 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
• Newton method for \(\ell_0\)-regularized optimization
• Bias versus non-convexity in compressed sensing
• Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
• Understanding large text corpora via sparse machine learning
• Biconvex Clustering
• Locally sparse and robust partial least squares in scalar-on-function regression
• Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
• Asymptotic theory of \(\ell_1\)-regularized PDE identification from a single noisy trajectory
• A component Lasso
• Randomized pick-freeze for sparse Sobol indices estimation in high dimension
• Sparse RBF surface representations
• Inferring Sparse Preference Lists from Partial Information
• Weak-type estimates for the metaplectic representation restricted to the shearing and dilation subgroup of \(\mathrm{SL}(2,\mathbb{R})\)
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
• Model selection via reweighted partial sparse recovery
• LPV system identification for control using the local approach
• Improved sparse coding under the influence of perceptual attention
• Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
• The power of convex relaxation, the surprising stories of matrix completion and compressed sensing
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• When does OMP achieve exact recovery with continuous dictionaries?
• Subset Selection and the Cone of Factor-Width-k Matrices
• Quadratic growth conditions and uniqueness of optimal solution to Lasso
• Weakly invariant norms: geometry of spheres in the space of skew-Hermitian matrices
• Exact recovery of the support of piecewise constant images via total variation regularization
• Independently interpretable Lasso for generalized linear models
• Inverse problems are solvable on real number signal processing hardware
• The Noise Collector for sparse recovery in high dimensions
• When Ramanujan meets time-frequency analysis in complicated time series analysis
• Imaging with highly incomplete and corrupted data
• Title not available (Why is that?)
• Leading impulse response identification via the elastic net criterion
• A smoothing method for sparse optimization over convex sets
• New bounds for subset selection from conic relaxations
• De-biasing the Lasso with degrees-of-freedom adjustment
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
• On FISTA with a relative error rule
• Analysis of simultaneous inpainting and geometric separation based on sparse decomposition
• Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory
• A simple homotopy proximal mapping algorithm for compressive sensing
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
• 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

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)