An iterative regularization method for nonlinear problems based on Bregman projections
From MaRDI portal
Publication:2835447
DOI10.1088/0266-5611/32/11/115013zbMath1433.65104OpenAlexW2528487761MaRDI QIDQ2835447
Publication date: 2 December 2016
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/32/11/115013
Related Items (15)
An asymptotical regularization with convex constraints for inverse problems ⋮ On the asymptotical regularization with convex constraints for nonlinear ill-posed problems ⋮ A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification ⋮ A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed 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 data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems ⋮ A projective averaged Kaczmarz iteration for nonlinear ill-posed problems ⋮ An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty ⋮ Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms ⋮ Sequential Subspace Optimization for Recovering Stored Energy Functions in Hyperelastic Materials from Time-Dependent Data ⋮ An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces ⋮ A projective two-point gradient Kaczmarz iteration for nonlinear ill-posed problems ⋮ The two-point gradient methods for nonlinear inverse problems based on Bregman projections ⋮ A projected Bouligand–Landweber iteration for non-smooth ill-posed problems
This page was built for publication: An iterative regularization method for nonlinear problems based on Bregman projections
