Iterative <em>l</em>₁ Minimization for Non-Convex Compressed Sensing

DOI10.4208/jcm.1610-m2016-0620zbMath1413.90223arXiv1604.07924OpenAlexW2963823000MaRDI QIDQ4688141

Penghang Yin, Jack X. Xin

Publication date: 22 October 2018

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07924

zbMATH Keywords

compressed sensingnon-convexitydifference of convex functions algorithmiterative \({\ell_1}\) minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations ⋮ Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing ⋮ Linear feature transform and enhancement of classification on deep neural network ⋮ Alternating direction method of multipliers with difference of convex functions