Convexly constrained linear inverse problems: iterative least-squares and regularization

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

Abstract

In this paper, we consider robust inversion of linear operators with convex constraints. We present an iteration that converges to the minimum norm least squares solution; a stopping rule is shown to regularize the constrained inversion. A constrained Laplace inversion is computed to illustrate the proposed algorithm.

Original languageEnglish (US)
Pages (from-to)2345-2352
Number of pages8
JournalIEEE Transactions on Signal Processing
Volume46
Issue number9
DOIs
StatePublished - 1998

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Convexly constrained linear inverse problems: iterative least-squares and regularization'. Together they form a unique fingerprint.

Cite this