A fast adaptive algorithm for nonlinear inverse problems with convex penalty
From MaRDI portal
Recommendations
- A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
- Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms
- A fast averaged Kaczmarz iteration with convex penalty for inverse problems in Hilbert spaces
- An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty
- Levenberg-Marquardt method with general convex penalty for nonlinear inverse problems
Cites work
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
- A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
- A modified Landweber iteration for solving parameter estimation problems
- A revisit on Landweber iteration
- Applications of the Modified Discrepancy Principle to Tikhonov Regularization of Nonlinear Ill-Posed Problems
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Inverse problems. Tikhonov theory and algorithms
- Iterative regularization methods for nonlinear ill-posed problems
- Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization
- Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
- Nonlinear total variation based noise removal algorithms
- Nonsmooth analysis
- Regularization methods in Banach spaces.
- Sparsity regularization for parameter identification problems
Cited in
(7)- An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty
- Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
- Fast adaptive algorithms in the non-standard form for multidimensional problems
- Adaptivity with relaxation for ill-posed problems and global convergence for a coefficient inverse problem
- A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
- Retraction note to: ``A fast adaptive algorithm for nonlinear inverse problems with convex penalty
- A Fast Data-Driven Iteratively Regularized Method with Convex Penalty for Solving Ill-Posed Problems
This page was built for publication: A fast adaptive algorithm for nonlinear inverse problems with convex penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103379)
