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

DOI10.1109/TIT.2005.864420zbMath1288.94025WikidataQ59750791 ScholiaQ59750791MaRDI QIDQ3547718

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

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

Related Items (only showing first 100 items - show all)

Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method ⋮ Proximal Splitting Methods in Signal Processing ⋮ Average Performance of the Sparsest Approximation Using a General Dictionary ⋮ Book Review: A mathematical introduction to compressive sensing ⋮ A component lasso ⋮ The Noise Collector for sparse recovery in high dimensions ⋮ Analysis of simultaneous inpainting and geometric separation based on sparse decomposition ⋮ When does OMP achieve exact recovery with continuous dictionaries? ⋮ Newton method for $\ell_0$-regularized optimization ⋮ Quadratic growth conditions and uniqueness of optimal solution to Lasso ⋮ SONIC: social network analysis with influencers and communities ⋮ Asymptotic Theory of $\boldsymbol \ell _1$ -Regularized PDE Identification from a Single Noisy Trajectory ⋮ Model selection via reweighted partial sparse recovery ⋮ Weakly invariant norms: geometry of spheres in the space of skew-Hermitian matrices ⋮ Matrix-wise $\ell_0$-constrained sparse nonnegative least squares ⋮ Nonlinear system identification in Sobolev spaces ⋮ On the informativity of direct identification experiments in dynamical networks ⋮ Biconvex Clustering ⋮ Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery ⋮ Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization ⋮ When Ramanujan meets time-frequency analysis in complicated time series analysis ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem ⋮ Disparity and optical flow partitioning using extended Potts priors ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ On FISTA with a relative error rule ⋮ Foundations of Gauge and Perspective Duality ⋮ Improved Sparse Coding Under the Influence of Perceptual Attention ⋮ Independently Interpretable Lasso for Generalized Linear Models ⋮ Inferring Sparse Preference Lists from Partial Information ⋮ On Reconstructing Functions from Binary Measurements ⋮ Unnamed Item ⋮ An adaptive inverse scale space method for compressed sensing ⋮ Towards a Mathematical Theory of Super‐resolution ⋮ Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models ⋮ Unnamed Item ⋮ Randomized pick-freeze for sparse Sobol indices estimation in high dimension ⋮ Linearized Bregman iterations for compressed sensing ⋮ Duality and Convex Programming ⋮ On the Convergence of the SINDy Algorithm ⋮ Resolution Analysis of Imaging with $\ell_1$ Optimization ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Necessary and sufficient conditions for linear convergence of ℓ1-regularization ⋮ Structured sparsity through convex optimization ⋮ A general theory of concave regularization for high-dimensional sparse estimation problems ⋮ Understanding large text corpora via sparse machine learning ⋮ Imaging with highly incomplete and corrupted data ⋮ Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction ⋮ Weak-Type Estimates for the Metaplectic Representation Restricted to the Shearing and Dilation Subgroup of $$SL(2,\mathbb {R})$$ ⋮ Statistical Optimization in High Dimensions ⋮ Sparse set membership identification of nonlinear functions and application to fault detection ⋮ Sparse Bayesian Imaging of Solar Flares ⋮ Sparse identification of nonlinear dynamics for model predictive control in the low-data limit ⋮ LPV system identification for control using the local approach ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Unnamed Item ⋮ Multi-Layer Sparse Coding: The Holistic Way ⋮ Solving Basis Pursuit ⋮ Sparse RBF surface representations ⋮ On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory ⋮ Best subset selection via a modern optimization lens ⋮ Relationship between the optimal solutions of least squares regularized with $\ell_{0}$-norm and constrained by $k$-sparsity ⋮ Signal recovery under cumulative coherence ⋮ Minimizers of sparsity regularized Huber loss function ⋮ High-dimensional variable selection ⋮ High-dimensional analysis of semidefinite relaxations for sparse principal components ⋮ De-biasing the Lasso with degrees-of-freedom adjustment ⋮ Data-driven design of two degree-of-freedom nonlinear controllers: the $\operatorname{D}^2$-IBC approach ⋮ Non-convex sparse regularisation ⋮ Matrix sparsification and the sparse null space problem ⋮ Bias versus non-convexity in compressed sensing ⋮ Regularity properties of non-negative sparsity sets ⋮ On stepwise pattern recovery of the fused Lasso ⋮ Gradient methods for minimizing composite functions ⋮ Proximal methods for reweighted $l_Q$-regularization of sparse signal recovery ⋮ Recovery of high-dimensional sparse signals via $\ell_1$-minimization ⋮ ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals ⋮ Leading impulse response identification via the elastic net criterion ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ A primal dual active set with continuation algorithm for the $\ell^0$-regularized optimization problem ⋮ Dualization of signal recovery problems ⋮ Optimal dual certificates for noise robustness bounds in compressive sensing ⋮ Beyond canonical dc-optimization: the single reverse polar problem ⋮ A smoothing method for sparse optimization over convex sets ⋮ Model-based multiple rigid object detection and registration in unstructured range data ⋮ Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model ⋮ A simple homotopy proximal mapping algorithm for compressive sensing ⋮ Exact optimization for the $\ell ^{1}$-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Support union recovery in high-dimensional multivariate regression ⋮ The residual method for regularizing ill-posed problems ⋮ Autoregressive process modeling via the Lasso procedure ⋮ Sharp support recovery from noisy random measurements by $\ell_1$-minimization ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ On verifiable sufficient conditions for sparse signal recovery via $\ell_{1}$ minimization ⋮ Direct data domain STAP using sparse representation of clutter spectrum ⋮ Registration-based compensation using sparse representation in conformal-array STAP ⋮ New insights on the optimality conditions of the $\ell_2-\ell_0$ minimization problem ⋮ High-dimensional covariance estimation by minimizing $\ell _{1}$-penalized log-determinant divergence

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