scientific article; zbMATH DE number 6746123
From MaRDI portal
Publication:5276403
zbMATH Open1374.94607MaRDI QIDQ5276403FDOQ5276403
Authors: Xiuqin Tian, Zhengshan Dong, Wenxing Zhu 
Publication date: 14 July 2017
Title of this publication is not available (Why is that?)
Recommendations
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- Sparse recovery of weighted nonconvex \(\ell_q\)-minimization
- Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
- Weighted <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula>-Minimization for Generalized Non-Uniform Sparse Model
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- A new algorithm for nonlinear \(L_ 1\)-norm minimization with nonlinear equality constraints
compressed sensingsparse optimizationrange space propertyequivalent condition\({l_0}\)-norm minimizationweighted \({l_1}\)-norm minimization
Cited In (3)
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276403)
