Just relax: convex programming methods for identifying sparse signals in noise
From MaRDI portal
Publication:3547718
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
Cited in
(only showing first 100 items - show all)- Lasso-type recovery of sparse representations for high-dimensional data
- Relaxed maximum a posteriori fault identification
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Mixed linear system estimation and identification
- A unified approach to model selection and sparse recovery using regularized least squares
- Nearly unbiased variable selection under minimax concave penalty
- Signal enhancement and the method of successive projections
- Sparse deconvolution using adaptive mixed-Gaussian models
- Signal recovery under cumulative coherence
- On stepwise pattern recovery of the fused Lasso
- Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model
- Compressed sensing with structured sparsity and structured acquisition
- TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration
- A CS recovery algorithm for model and time delay identification of MISO-FIR systems
- Control of MIMO nonlinear systems: a data-driven model inversion approach
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Templates for convex cone problems with applications to sparse signal recovery
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- Beyond canonical dc-optimization: the single reverse polar problem
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- IDENT: identifying differential equations with numerical time evolution
- Limited-complexity controller tuning: a set membership data-driven approach
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- When is there a representer theorem? Reflexive Banach spaces
- Second-order Stein: SURE for SURE and other applications in high-dimensional inference
- Structured iterative hard thresholding with on- and off-grid applications
- In defense of the indefensible: a very naïve approach to high-dimensional inference
- New bounds for subset selection from conic relaxations
- Robust sparse recovery via a novel convex model
- Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory
- De-biasing the Lasso with degrees-of-freedom adjustment
- Bias versus non-convexity in compressed sensing
- A smoothing method for sparse optimization over convex sets
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Homogeneous penalizers and constraints in convex image restoration
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- Stable restoration and separation of approximately sparse signals
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
- A numerical exploration of compressed sampling recovery
- Sorted concave penalized regression
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- Sparse reconstruction with multiple Walsh matrices
- Alternating direction method of multipliers for solving dictionary learning models
- Robust computation of linear models by convex relaxation
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Sparse RBF surface representations
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Leading impulse response identification via the elastic net criterion
- 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
- Support union recovery in high-dimensional multivariate regression
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
- Sparsity- and continuity-promoting seismic image recovery with curvelet frames
- Rodeo: Sparse, greedy nonparametric regression
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- 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
- On the informativity of direct identification experiments in dynamical networks
- When Ramanujan meets time-frequency analysis in complicated time series analysis
- On FISTA with a relative error rule
- Randomized pick-freeze for sparse Sobol indices estimation in high dimension
- Duality and Convex Programming
- Resolution analysis of imaging with _1 optimization
- Low complexity regularization of linear inverse problems
- Best subset selection via a modern optimization lens
- Statistical optimization in high dimensions
- Sparse set membership identification of nonlinear functions and application to fault detection
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Proximal splitting methods in signal processing
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Linearized Bregman iterations for compressed sensing
- Necessary and sufficient conditions for linear convergence of ^1-regularization
- Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach
- Average Performance of the Sparsest Approximation Using a General Dictionary
- Book Review: A mathematical introduction to compressive sensing
- On reconstructing functions from binary measurements
- Regularity properties of non-negative sparsity sets
- A component Lasso
- Gradient methods for minimizing composite functions
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Model-based multiple rigid object detection and registration in unstructured range data
- The residual method for regularizing ill-posed problems
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Two are better than one: fundamental parameters of frame coherence
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Disparity and optical flow partitioning using extended Potts priors
- Proximal mapping for symmetric penalty and sparsity
- Convolutional neural networks analyzed via convolutional sparse coding
- Piecewise-polynomial signal segmentation using convex optimization.
- An adaptive inverse scale space method for compressed sensing
- Understanding large text corpora via sparse machine learning
- Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
- Multi-layer sparse coding: the holistic way
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)
