Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
From MaRDI portal
Publication:2681229
DOI10.1515/jiip-2020-0049OpenAlexW4306812361MaRDI QIDQ2681229
Publication date: 7 February 2023
Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip-2020-0049
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- The restricted isometry property and its implications for compressed sensing
- Recovery of signals under the condition on RIC and ROC via prior support information
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Fast L1-L2 minimization via a proximal operator
- A short note on compressed sensing with partially known signal support
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
- Outlier-Robust Greedy Pursuit Algorithms in <formula formulatype="inline"><tex Notation="TeX">$\ell _{p}$</tex> </formula>-Space for Sparse Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Recovering Compressively Sampled Signals Using Partial Support Information
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Compressed sensing
This page was built for publication: Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
