An iterative regularization method for nonlinear problems based on Bregman projections
From MaRDI portal
Recommendations
- An iteratively regularized projection method with quadratic convergence for nonlinear ill-posed problems
- Expanding the applicability of an iterative regularization method for ill-posed problems
- A simplified iteratively regularized projection method for nonlinear ill-posed problems
- Convergence of projected iterative regularization methods for nonlinear problems with smooth solutions
- On broyden's method for the regularization of nonlinear ill-posed problems
Cited in
(23)- A multiprojection algorithm using Bregman projections in a product space
- On the asymptotical regularization with convex constraints for nonlinear ill-posed problems
- An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty
- An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces
- A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
- An iterative Bregman regularization method for optimal control problems with inequality constraints
- scientific article; zbMATH DE number 5968553 (Why is no real title available?)
- Singular regularization of inverse problems. Bregman distances and their applications of variational frameworks with singular regularization energies
- Sequential subspace optimization for recovering stored energy functions in hyperelastic materials from time-dependent data
- scientific article; zbMATH DE number 4046984 (Why is no real title available?)
- Iterating Bregman Retractions
- A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
- 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
- An asymptotical regularization with convex constraints for inverse problems
- A fast averaged Kaczmarz iteration with convex penalty for inverse problems in Hilbert spaces
- A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
- Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms
- A projected Bouligand–Landweber iteration for non-smooth ill-posed problems
- 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 Bregman–Kaczmarz method for nonlinear systems of equations
- An accelerated Bouligand-Landweber method based on projection and Nesterov acceleration for nonsmooth ill-posed problems
This page was built for publication: An iterative regularization method for nonlinear problems based on Bregman projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835447)
