The two-point gradient methods for nonlinear inverse problems based on Bregman projections

DOI10.1088/1361-6420/ab6f9dOpenAlexW3002589431MaRDI QIDQ5000586

Wei Wang, Min Zhong

Publication date: 14 July 2021

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ab6f9d

zbMATH Keywords

nonlinear ill-posed problemsBregman projectioniterative regularization methodstwo-point gradient methods

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22)

Related Items (5)

An asymptotical regularization with convex constraints for inverse problems ⋮ A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces ⋮ A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces ⋮ A projective averaged Kaczmarz iteration for nonlinear ill-posed problems ⋮ A projected Bouligand–Landweber iteration for non-smooth ill-posed problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative solution of large sparse systems of equations
• Levenberg-Marquardt method in Banach spaces with general convex regularization terms
• Regularization methods in Banach spaces.
• Convergence rates for regularization with sparsity constraints
• Regularization properties of Tikhonov regularization with sparsity constraints
• Nonsmooth analysis
• Iterative regularization methods for nonlinear ill-posed problems
• A regularizing multilevel approach for nonlinear inverse problems
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Regularization of inverse problems by two-point gradient methods in Banach spaces
• On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems
• Identification of non-smooth boundary heat dissipation by partial boundary data
• Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
• Landweber-Kaczmarz method in Banach spaces with inexact inner solvers
• An iterative regularization method for nonlinear problems based on Bregman projections
• Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
• The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
• Elastic-net regularization versus ℓ ¹ -regularization for linear inverse problems with quasi-sparse solutions
• Iterative regularization with a general penalty term—theory and application to L ¹ and TV regularization
• Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
• Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods
• Fast regularizing sequential subspace optimization in Banach spaces
• Elastic-net regularization: error estimates and active set methods
• ON CERTAIN INVERSE PROBLEMS FOR PARABOLIC EQUATIONS WITH FINAL AND INTEGRAL OBSERVATION
• A convergence rates result for an iteratively regularized Gauss–Newton–Halley method in Banach space
• Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

This page was built for publication: The two-point gradient methods for nonlinear inverse problems based on Bregman projections