A minimal error conjugate gradient method for ill-posed problems

DOI10.1007/BF00940009zbMath0632.90090MaRDI QIDQ1095816

J. Thomas King

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940009

zbMATH Keywords

Hilbert space; ill-posed operator equation; conjugate gradient method; minimal error

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C48: Programming in abstract spaces

Related Items

A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems, The Minimal Error Conjugate Gradient Method is a Regularization Method, Conjugate gradient acceleration of iteratively re-weighted least squares methods, Boundary element-minimal error method for the Cauchy problem associated with Helmholtz-type equations, Multilevel algorithms for ill-posed problems, On the construction of preconditioners by subspace decomposition, Convergence rate results for steepest descent type method for nonlinear ill-posed equations, The minimal error method for the Cauchy problem in linear elasticity. Numerical implementation for two-dimensional homogeneous isotropic linear elasticity, On a monotone ill-posed problem, A class of iterative methods of conjugate gradient type

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative methods for the solution of a linear operator equation in Hilbert space. A survey
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Steepest descent for singular linear operators with nonclosed range
• Steepest Descent for Singular Linear Operator Equations
• On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
• An Iteration Formula for Fredholm Integral Equations of the First Kind
• The N‐Step Iteration Procedures