A sparse regularization approach with Log type penalty

DOI10.3969/J.ISSN.1008-5513.2015.01.004MaRDI QIDQ3196161zbMATHFDO

Authors

Publication date 28 October 2015

zbMATH Keywords

sparsitycompressive sensingiterative thresholding algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Database theory (68P15)

Recommendations

• Sparse regularization with l ^q penalty term
• Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
• SparseNet: coordinate descent with nonconvex penalties
• A unified approach to model selection and sparse recovery using regularized least squares
• On the role of sparsity in inverse problems

Cited in

(3)

• Removing the singularity of a penalty via thresholding function matching
• Penalized principal logistic regression for sparse sufficient dimension reduction
• Sparse regression with multi-type regularized feature modeling

This page was built for publication: A sparse regularization approach with Log type penalty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196161)