A fast adaptive algorithm for nonlinear inverse problems with convex penalty

Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48) Inverse problems in optimal control (49N45) Numerical solution to inverse problems in abstract spaces (65J22)

Cites Work

Unnamed Item
Unnamed Item
Nonlinear total variation based noise removal algorithms
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Regularization methods in Banach spaces.
Automatic stopping rule for iterative methods in discrete ill-posed problems
Nonsmooth analysis
Iterative regularization methods for nonlinear ill-posed problems
A modified Landweber iteration for solving parameter estimation problems
Mirror descent and nonlinear projected subgradient methods for convex optimization.
A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
Inverse Problems
Iterative regularization with a general penalty term—theory and application to L ¹ and TV regularization
Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
A revisit on Landweber iteration
Applications of the Modified Discrepancy Principle to Tikhonov Regularization of Nonlinear Ill-Posed Problems
A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
Sparsity regularization for parameter identification problems
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces

This page was built for publication: A fast adaptive algorithm for nonlinear inverse problems with convex penalty