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)- 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
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- On the convergence of the SINDy algorithm
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Signal recovery under cumulative coherence
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Convolutional neural networks analyzed via convolutional sparse coding
- Robust sparse recovery via a novel convex model
- Locally sparse and robust partial least squares in scalar-on-function regression
- Proximal splitting methods in signal processing
- Towards a Mathematical Theory of Super‐resolution
- Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
- Nonlinear system identification in Sobolev spaces
- Low complexity regularization of linear inverse problems
- Foundations of gauge and perspective duality
- Beyond canonical dc-optimization: the single reverse polar problem
- A component Lasso
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Asymptotic theory of \(\ell_1\)-regularized PDE identification from a single noisy trajectory
- Proximal mapping for symmetric penalty and sparsity
- When do stepwise algorithms meet subset selection criteria?
- Randomized pick-freeze for sparse Sobol indices estimation in high dimension
- The residual method for regularizing ill-posed problems
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Sparse set membership identification of nonlinear functions and application to fault detection
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Mixed linear system estimation and identification
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Alternating direction method of multipliers for solving dictionary learning models
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Sparse RBF surface representations
- Disparity and optical flow partitioning using extended Potts priors
- Two are better than one: fundamental parameters of frame coherence
- SONIC: social network analysis with influencers and communities
- Stable restoration and separation of approximately sparse signals
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- 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})\)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Model selection via reweighted partial sparse recovery
- Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach
- LPV system identification for control using the local approach
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
- Improved sparse coding under the influence of perceptual attention
- A numerical exploration of compressed sampling recovery
- Relaxed maximum a posteriori fault identification
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective
- An adaptive inverse scale space method for compressed sensing
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- When is there a representer theorem? Reflexive Banach spaces
- Inferring stable genetic networks from steady-state data
- The power of convex relaxation, the surprising stories of matrix completion and compressed sensing
- A CS recovery algorithm for model and time delay identification of MISO-FIR systems
- Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
- Sparse reconstruction with multiple Walsh matrices
- Optimal dual certificates for noise robustness bounds in compressive sensing
- When does OMP achieve exact recovery with continuous dictionaries?
- Second-order Stein: SURE for SURE and other applications in high-dimensional inference
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- Resolution analysis of imaging with \(\ell_1\) optimization
- Optimal identification experiment design for LPV systems using the local approach
- Nearly unbiased variable selection under minimax concave penalty
- Sparsity- and continuity-promoting seismic image recovery with curvelet frames
- TV+TV regularization with nonconvex sparseness-inducing penalty for image restoration
- Regularized learning in Banach spaces as an optimization problem: representer theorems
- Subset Selection and the Cone of Factor-Width-k Matrices
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)
