Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
From MaRDI portal
Publication:2190319
DOI10.3934/jimo.2019035zbMath1449.90327OpenAlexW2945669348MaRDI QIDQ2190319
Publication date: 18 June 2020
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019035
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Discrete approximations in optimal control (49M25)
Related Items (2)
Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ A wonderful triangle in compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A unified approach to model selection and sparse recovery using regularized least squares
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Low rank matrix recovery from rank one measurements
- A mathematical introduction to compressive sensing
- Optimal detection of sparse principal components in high dimension
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On scaled projections and pseudoinverses
- Sparse approximate reconstruction decomposed by two optimization problems
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
- Exact matrix completion via convex optimization
- Atomic Decomposition by Basis Pursuit
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- From Denoising to Compressed Sensing
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Compressed sensing and best 𝑘-term approximation
- An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Sparse Signal Approximation via Nonseparable Regularization
- Sparse Regularization via Convex Analysis
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- A general theory of concave regularization for high-dimensional sparse estimation problems
This page was built for publication: Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
