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)- Book Review: A mathematical introduction to compressive sensing
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- Adaptive algorithms for sparse system identification
- Signal enhancement and the method of successive projections
- A unified approach to model selection and sparse recovery using regularized least squares
- Regularity properties of non-negative sparsity sets
- On the conditioning of random subdictionaries
- In defense of the indefensible: a very naïve approach to high-dimensional inference
- Weakly invariant norms: geometry of spheres in the space of skew-Hermitian matrices
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Linearized Bregman iterations for compressed sensing
- Exact recovery of the support of piecewise constant images via total variation regularization
- Direct data domain STAP using sparse representation of clutter spectrum
- Registration-based compensation using sparse representation in conformal-array STAP
- Theoretical guarantees for graph sparse coding
- Best subset selection via a modern optimization lens
- Piecewise-polynomial signal segmentation using convex optimization.
- 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
- Independently interpretable Lasso for generalized linear models
- Gradient methods for minimizing composite functions
- Dualization of signal recovery problems
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Compressed sensing with structured sparsity and structured acquisition
- The Noise Collector for sparse recovery in high dimensions
- Inverse problems are solvable on real number signal processing hardware
- Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
- On reconstructing functions from binary measurements
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- When Ramanujan meets time-frequency analysis in complicated time series analysis
- Robust computation of linear models by convex relaxation
- Solve exactly an under determined linear system by minimizing least squares regularized with an _0 penalty
- Structured iterative hard thresholding with on- and off-grid applications
- Imaging with highly incomplete and corrupted data
- Autoregressive process modeling via the Lasso procedure
- Solving basis pursuit: heuristic optimality check and solver comparison
- Leading impulse response identification via the elastic net criterion
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- scientific article; zbMATH DE number 7625181 (Why is no real title available?)
- Rodeo: Sparse, greedy nonparametric regression
- A smoothing method for sparse optimization over convex sets
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- Lasso-type recovery of sparse representations for high-dimensional data
- New bounds for subset selection from conic relaxations
- High-dimensional variable selection
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Support union recovery in high-dimensional multivariate regression
- De-biasing the Lasso with degrees-of-freedom adjustment
- Homogeneous penalizers and constraints in convex image restoration
- Structured sparsity through convex optimization
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Templates for convex cone problems with applications to sparse signal recovery
- On FISTA with a relative error rule
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
- Analysis of simultaneous inpainting and geometric separation based on sparse decomposition
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Sparse signal recovery using a new class of random matrices
- Iterative identification for multivariable systems with time-delays based on basis pursuit de-noising and auxiliary model
- Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
- Duality and Convex Programming
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- A simple homotopy proximal mapping algorithm for compressive sensing
- Average Performance of the Sparsest Approximation Using a General Dictionary
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- A new computational method for the sparsest solutions to systems of linear equations
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Newton method for \(\ell_0\)-regularized optimization
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Sparse Bayesian imaging of solar flares
- Multi-layer sparse coding: the holistic way
- On stepwise pattern recovery of the fused Lasso
- Spectral dynamics and regularization of incompletely and irregularly measured data
- Minimizers of sparsity regularized Huber loss function
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Bias versus non-convexity in compressed sensing
- Fixed point and Bregman iterative methods for matrix rank minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
- Sorted concave penalized regression
- Confidence intervals for low dimensional parameters in high dimensional linear models
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Model-based multiple rigid object detection and registration in unstructured range data
- Non-convex sparse regularisation
- Sparse approximate solution of partial differential equations
- On the informativity of direct identification experiments in dynamical networks
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Understanding large text corpora via sparse machine learning
- IDENT: identifying differential equations with numerical time evolution
- Limited-complexity controller tuning: a set membership data-driven approach
- A semidefinite programming study of the Elfving theorem
- Biconvex Clustering
- Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
- Control of MIMO nonlinear systems: a data-driven model inversion approach
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Iterative thresholding for sparse approximations
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)
