Convergence analysis of the FOCUSS algorithm
Its authors withdrew this paper, so there is no full text to read or summarize.
Lists
Only you see this
Abstract
FOCal Underdetermined System Solver (FOCUSS) is a powerful tool for sparse representation and underdetermined inverse problems, which is extremely easy to implement. In this paper, we give a comprehensive convergence analysis on the FOCUSS algorithm towards establishing a systematic convergence theory by providing three primary contributions as follows. First, we give a rigorous derivation for this algorithm exploiting the auxiliary function. Then, we prove its convergence. Third, we systematically study its convergence rate with respect to the sparsity parameter p and demonstrate its convergence rate by numerical experiments.
BibTeX
@misc{he2012convergence,
author = {Zhaoshui He and Shengli Xie and Andrzej Cichocki},
title = {{Convergence analysis of the FOCUSS algorithm}},
year = {2012},
eprint = {1202.5470},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1202.5470},
}Loading related content...