Back to search

Central Florida

Iteratively Reweighted Least Squares Minimization With Prior Information A New Approach

Abstract

dc:description.abstract

Iteratively reweighted least squares (IRLS) algorithms provide an alternative to the more standard 1 l -minimization approach in compressive sensing. Daubechies et al. introduced a particularly stable version of an IRLS algorithm and rigorously proved its convergence in 2010. They did not, however, consider the case in which prior information on the support of the sparse domain of the solution is available. In 2009, Miosso et al. proposed an IRLS algorithm that makes use of this information to further reduce the number of measurements required to recover the solution with specified accuracy. Although Miosso et al. obtained a number of simulation results strongly confirming the utility of their approach, they did not rigorously establish the convergence properties of their algorithm. In this paper, we introduce prior information on the support of the sparse domain of the solution into the algorithm of Daubechies et al. We then provide a rigorous proof of the convergence of the resulting algorithm.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Popov, Dmitriy
Contributors dc:contributor
  • Li, Xin

Subjects

dc:subject × 4

Rights

Language dc:language
English

Identifiers

dc:identifier.*
Identifier
CFE0004154

Chain of custody

source
Harvested from
Central Florida
Base URL
stars.library.ucf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Popov, Dmitriy. Iteratively Reweighted Least Squares Minimization With Prior Information A New Approach. https://stars.library.ucf.edu/etd/1701