作者: G. Harikumar , Y. Bresler
DOI: 10.1109/ICASSP.1996.543672
关键词:
摘要: We present an iterative algorithm for computing sparse solutions (or approximate solutions) to linear inverse problems. The is intended supplement the existing arsenal of techniques. It shown converge local minima a function form used picking out solutions, and its connection with techniques explained. Finally, it demonstrated on subset selection deconvolution examples. fact that proposed sometimes successful when greedy algorithms fail also demonstrated.