Optimality analysis on partial \(l_1\)-minimization recovery
From MaRDI portal
Publication:683727
DOI10.1007/s10898-017-0567-0zbMath1425.94012OpenAlexW2754428361MaRDI QIDQ683727
Huan Gao, Kai Tu, Zhibao Li, Hai-Bin Zhang
Publication date: 9 February 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0567-0
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (1)
Cites Work
- Unnamed Item
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- A short note on compressed sensing with partially known signal support
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Sparse Approximate Solutions to Linear Systems
- Restricted completion of sparse partial Latin squares
- Recovering Compressively Sampled Signals Using Partial Support Information
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
This page was built for publication: Optimality analysis on partial \(l_1\)-minimization recovery