Back to search

Central Florida

Solution of Linear Ill-posed Problems Using Overcomplete Dictionaries

Abstract

dc:description.abstract

In this dissertation, we consider an application of overcomplete dictionaries to the solution of general ill-posed linear inverse problems. In the context of regression problems, there has been an enormous amount of effort to recover an unknown function using such dictionaries. While some research on the subject has been already carried out, there are still many gaps to address. In particular, one of the most popular methods, lasso, and its variants, is based on minimizing the empirical likelihood and unfortunately, requires stringent assumptions on the dictionary, the so-called, compatibility conditions. Though compatibility conditions are hard to satisfy, it is well known that this can be accomplished by using random dictionaries. In the first part of the dissertation, we show how one can apply random dictionaries to the solution of ill-posed linear inverse problems with Gaussian noise. We put a theoretical foundation under the suggested methodology and study its performance via simulations and real-data example. In the second part of the dissertation, we investigate the application of lasso to the linear ill-posed problems with non-Gaussian noise. We have developed a theoretical background for the application of lasso to such problems and studied its performance via simulations.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gupta, Pawan
Contributors dc:contributor
  • Pensky, Marianna

Subjects

dc:subject × 1

Rights

Language dc:language
English

Identifiers

dc:identifier.*
Identifier
CFE0007811

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
related terms
citation

Gupta, Pawan. Solution of Linear Ill-posed Problems Using Overcomplete Dictionaries. https://stars.library.ucf.edu/etd/6747