Dual gradient flow for solving linear ill-posed problems in Banach spaces

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Jin, Qinian, Wang, Wei
Format: Preprint
Publié: 2022
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909162104946688
author Jin, Qinian
Wang, Wei
author_facet Jin, Qinian
Wang, Wei
contents We consider determining the $\R$-minimizing solution of ill-posed problem $A x = y$ for a bounded linear operator $A: X \to Y$ from a Banach space $X$ to a Hilbert space $Y$, where $\R: X \to (-\infty, \infty]$ is a strongly convex function. A dual gradient flow is proposed to approximate the sought solution by using noisy data. Due to the ill-posedness of the underlying problem, the flow demonstrates the semi-convergence phenomenon and a stopping time should be chosen carefully to find reasonable approximate solutions. We consider the choice of a proper stopping time by various rules such as the {\it a priori} rules, the discrepancy principle, and the heuristic discrepancy principle and establish the respective convergence results. Furthermore, convergence rates are derived under the variational source conditions on the sought solution. Numerical results are reported to test the performance of the dual gradient flow.
format Preprint
id arxiv_https___arxiv_org_abs_2209_05682
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Dual gradient flow for solving linear ill-posed problems in Banach spaces
Jin, Qinian
Wang, Wei
Numerical Analysis
Optimization and Control
We consider determining the $\R$-minimizing solution of ill-posed problem $A x = y$ for a bounded linear operator $A: X \to Y$ from a Banach space $X$ to a Hilbert space $Y$, where $\R: X \to (-\infty, \infty]$ is a strongly convex function. A dual gradient flow is proposed to approximate the sought solution by using noisy data. Due to the ill-posedness of the underlying problem, the flow demonstrates the semi-convergence phenomenon and a stopping time should be chosen carefully to find reasonable approximate solutions. We consider the choice of a proper stopping time by various rules such as the {\it a priori} rules, the discrepancy principle, and the heuristic discrepancy principle and establish the respective convergence results. Furthermore, convergence rates are derived under the variational source conditions on the sought solution. Numerical results are reported to test the performance of the dual gradient flow.
title Dual gradient flow for solving linear ill-posed problems in Banach spaces
topic Numerical Analysis
Optimization and Control
url https://arxiv.org/abs/2209.05682