Accelerated Landweber iterations for the solution of ill-posed equations
From MaRDI portal
Publication:1180765
DOI10.1007/BF01385727zbMath0745.65038MaRDI QIDQ1180765
Publication date: 27 June 1992
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133597
linear ill-posed problemsregularization methodsNumerical examplesfast decreasing polynomialsmethod of conjugate gradientsaccelerated Landweber iterationsill-conditioned matrix equationslinear semiiterative methodsoptimal speed of convergence
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items (45)
Implicit iterative method for III-posed equations with perturbed operators and data ⋮ A novel two-point gradient method for regularization of inverse problems in Banach spaces ⋮ R-K type Landweber method for nonlinear ill-posed problems ⋮ Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional ⋮ An implicit shift bidiagonalization algorithm for ill-posed systems ⋮ Generalized inexact Newton regularization for nonlinear ill-posed problems in Banach spaces ⋮ Convergence rates of a dual gradient method for constrained linear ill-posed problems ⋮ A fast realization of preconditioned conjugate gradients for Wiener-Hopf integral equations ⋮ On adaptive discretization schemes for the solution of ill-posed problems with semiiterative methods ⋮ Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems ⋮ Error estimates for the iteratively regularized Newton-Landweber method in Banach spaces under approximate source conditions ⋮ New POCS algorithms for regularization of inverse problems ⋮ Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind ⋮ Adaptive scheme of discretization for one semi-iterative method in solving ill-posed problems ⋮ Regularization with Differential Operators: An Iterative Approach ⋮ A Projected Nesterov–Kaczmarz Approach to Stellar Population-Kinematic Distribution Reconstruction in Extragalactic Archaeology ⋮ A predictor-corrector iterated Tikhonov regularization for linear ill-posed inverse problems ⋮ Convergence analysis of the homotopy perturbation method for solving nonlinear ill-posed operator equations ⋮ A general framework for ADMM acceleration ⋮ Convergence analysis of a two-point gradient method for nonlinear ill-posed problems ⋮ Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework ⋮ A new method for TSVD regularization truncated parameter selection ⋮ A Modified Tikhonov Regularization for Linear Operator Equations ⋮ Image reconstruction and restoration using the simplified topological \(\varepsilon\)-algorithm ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ Multiwave tomography with reflectors: Landweber's iteration ⋮ The fast Fourier transform method and ill-conditioned matrices ⋮ Accelerated Landweber methods based on co-dilated orthogonal polynomials ⋮ Fast fully iterative Newton-type methods for inverse problems ⋮ An accelerated alternating procedure for the Cauchy problem for the Helmholtz equation ⋮ EM Algorithms ⋮ An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems ⋮ An analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints ⋮ The Minimal Error Conjugate Gradient Method is a Regularization Method ⋮ Risk hull method for spectral regularization in linear statistical inverse problems ⋮ Nonstationary iterated Tikhonov regularization ⋮ Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces ⋮ Frozen Landweber iteration for nonlinear ill-posed problems ⋮ An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces ⋮ Optimal-order convergence of Nesterov acceleration for linear ill-posed problems* ⋮ Monotonicity of error of regularized solution and its use for parameter choice ⋮ Regularization of inverse problems by two-point gradient methods in Banach spaces ⋮ Inexact Newton regularization combined with two-point gradient methods for nonlinear ill-posed problems * ⋮ Preconditioning Landweber iteration in Hilbert scales ⋮ Corrosion detection in a 2D domain with a polygonal boundary
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The instability of some gradient methods for ill-posed problems
- The discrete Picard condition for discrete ill-posed problems
- Approximation by algebraic polynomials in an integral metric with Jacobi weight
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Weighted polynomial inequalities
- Semi-iterative methods for the approximate solution of ill-posed problems
- Regularization of ill-posed problems by stochastic iteration procedures in the mean
- Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. (Iterative methods for nonsymmetric systems of equations and approximation methods in the complex domain)
- Pointwise rational approximation and iterative methods for ill-posed problems
- Error estimates of the successive approximation method for ill-posed problems
- Fast decreasing polynomials
- Optimal algorithms for linear ill-posed problems yield regularization methods
- The discrepancy principle for a class of regularization methods
- Application of Chebyshev polynomials to the regularization of ill-posed and ill-conditioned equations in Hilbert space
- Theory and Methods Related to the Singular-Function Expansion and Landweber’s Iteration for Integral Equations of the First Kind
- On Existence Criteria and Approximation Procedures for Integral Equations of the First Kind
- Orthogonal polynomials
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- The regularizing properties of the adjoint gradient method in ill-posed problems
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Linear integral equations
This page was built for publication: Accelerated Landweber iterations for the solution of ill-posed equations
