Convergence of the gradient method for ill-posed problems

DOI10.3934/IPI.2017033MaRDI QIDQ2360784zbMATH OpenOpenAlexFDO

Authors Stefan Kindermann

Publication date 12 July 2017

Published in Inverse Problems and Imaging (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1606.00274

zbMATH Keywords

convergenceHilbert spaceinverse problemsill-posed problemsLandweber iterationnonlinear operator equationsiterative regularizationquasiconvexitygradient descent methodtangential cone condition

Mathematics Subject Classification ID

Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)

Abstract: We study the convergence of the gradient descent method for solving ill-posed problems where the solution is characterized as a global minimum of a differentiable functional in a Hilbert space. The classical least-squares functional for nonlinear operator equations is a special instance of this framework and the gradient method then reduces to Landweber iteration. The main result of this article is a proof of weak and strong convergence under new nonlinearity conditions that generalize the classical tangential cone conditions.

Recommendations

• A new gradient method for ill-posed problems
• On the convergence of gradient-type methods for nonlinear equations
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
• Convergence results of a modified regularized gradient method for nonlinear ill-posed problems

Cites work

• scientific article; zbMATH DE number 702316 (Why is no real title available?)
• scientific article; zbMATH DE number 2146003 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• A general convergence analysis of some Newton-type methods for nonlinear inverse problems
• A posteriori stopping rule for regularized fixed point iterations
• A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
• Accelerated Landweber iteration in Banach spaces
• Construction of fixed points of nonlinear mappings in Hilbert space
• Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems
• Dynamical systems gradient method for solving nonlinear equations with monotone operators
• Dynamical systems method for ill-posed equations with monotone operators
• Iterative Regularization and Generalized Discrepancy Principle for Monotone Operator Equations
• Iterative methods for ill-posed problems. An introduction.
• Iterative regularization methods for nonlinear ill-posed problems
• Kaczmarz methods for regularizing nonlinear ill-posed equations. I: Convergence analysis
• On Landweber iteration for nonlinear ill-posed problems in Hilbert scales
• On the convergence of gradient-type methods for nonlinear equations
• Quasi-Concave Programming
• Regularization methods in Banach spaces.
• Regularized fixed-point iterations for nonlinear inverse problems
• Some Newton-type methods for the regularization of nonlinear ill-posed problems
• Some generalizations for Landweber iteration for nonlinear ill-posed problems in Hilbert scales
• The dynamical systems method for solving nonlinear equations with monotone operators

Cited in

(20)

• Bi-level iterative regularization for inverse problems in nonlinear PDEs
• Descent gradient methods for nonsmooth minimization problems in ill-posed problems
• On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
• Iterative regularization for constrained minimization formulations of nonlinear inverse problems
• Generalized cross-validation applied to conjugate gradient for discrete ill-posed problems
• Convergence rate estimation of gradient methodsviaconditional stability of inverse and ill-posed problems
• Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
• Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
• Dual gradient method for ill-posed problems using multiple repeated measurement data
• Conditional stability stopping rule for gradient methods applied to inverse and ill-posed problems
• The tangential cone condition for some coefficient identification model problems in parabolic PDEs
• On the tangential cone condition for electrical impedance tomography
• Regularization of inverse problems via box constrained minimization
• ON RULES FOR STOPPING THE CONJUGATE GRADIENT TYPE METHODS IN ILL‐POSED PROBLEMS
• Convergence rates of a dual gradient method for constrained linear ill-posed problems
• A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration
• Minimization Based Formulations of Inverse Problems and Their Regularization
• Discretization of parameter identification in PDEs using neural networks
• A new gradient method for ill-posed problems
• On the convergence of gradient-type methods for nonlinear equations

This page was built for publication: Convergence of the gradient method for ill-posed problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2360784)