A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
From MaRDI portal
Publication:2666520
DOI10.1016/j.matcom.2021.09.004OpenAlexW3199991622MaRDI QIDQ2666520
Guangyu Gao, Shanshan Tong, Bo Han
Publication date: 22 November 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01728
discrepancy principlenonlinear ill-posed problemssequential subspace optimizationtwo-point gradient method
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential subspace optimization for nonlinear inverse problems
- Iterative regularization methods for nonlinear ill-posed problems
- Variational methods in imaging
- Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- 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
- A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
- Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
- Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods
- Fast regularizing sequential subspace optimization in Banach spaces
- A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
- Iterative methods for the reconstruction of an inverse potential problem
- A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
- 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
- An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems
- Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms
- 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
This page was built for publication: A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
