A Fast Data-Driven Iteratively Regularized Method with Convex Penalty for Solving Ill-Posed Problems

DOI10.1137/22m1506778zbMath1516.65043MaRDI QIDQ6173539

Zhenwu Fu, Shanshan Tong, Bo Han, Guangyu Gao

Publication date: 21 July 2023

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

zbMATH Keywords

iterative regularizationdata-drivenhomotopy perturbationconvex penaltyblack box strategytwo-point gradient

Mathematics Subject Classification ID

Numerical methods for ill-posed problems for integral equations (65R30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Convergence analysis of the homotopy perturbation method for solving nonlinear ill-posed operator equations
• Iterative regularization methods for nonlinear ill-posed problems
• A modified Landweber iteration for solving parameter estimation problems
• The problem of the convergence of the iteratively regularized Gauss- Newton method
• A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems
• Levenberg-Marquardt method with general convex penalty for nonlinear inverse problems
• A fast two-point gradient method for solving non-smooth nonlinear ill-posed problems
• An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces
• Regularization of inverse problems by two-point gradient methods in Banach spaces
• Kaczmarz methods for regularizing nonlinear ill-posed equations. II: Applications
• Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
• Inverse Problems
• A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
• Improved and extended results for enhanced convergence rates of Tikhonov regularization in Banach spaces
• Fast regularizing sequential subspace optimization in Banach spaces
• Applications of the Modified Discrepancy Principle to Tikhonov Regularization of Nonlinear Ill-Posed Problems
• A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
• The Averaged Kaczmarz Iteration for Solving Inverse Problems
• An accelerated homotopy perturbation iteration for nonlinear ill-posed problems in Banach spaces with uniformly convex penalty
• Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces
• A projective two-point gradient Kaczmarz iteration for nonlinear ill-posed problems
• A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces
• A Data-Driven Iteratively Regularized Landweber Iteration
• Data driven regularization by projection
• An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems
• Solving inverse problems using data-driven models
• Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
• A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
• A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
• Regularizing Newton--Kaczmarz Methods for Nonlinear Ill-Posed Problems