Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms

DOI10.1088/1361-6420/ab2a2bzbMath1485.65066OpenAlexW2950350550MaRDI QIDQ5210420

No author found.

Publication date: 20 January 2020

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ab2a2b

zbMATH Keywords

iterative regularizationnonlinear inverse problemsBregman projectionsequential subspace optimizationuniformly convex penalty

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for inverse problems for integral equations (65R32)

Related Items (15)

An asymptotical regularization with convex constraints for inverse problems ⋮ Generalized inexact Newton regularization for nonlinear ill-posed problems in Banach spaces ⋮ On the asymptotical regularization with convex constraints for nonlinear ill-posed problems ⋮ 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 ⋮ On the Convergence of Stochastic Gradient Descent for Linear Inverse Problems in Banach Spaces ⋮ An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty ⋮ Inverse problems with inexact forward operator: iterative regularization and application in dynamic imaging ⋮ Inexact Newton regularization in Banach spaces based on two-point gradient method with uniformly convex penalty terms ⋮ An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems ⋮ An accelerated homotopy perturbation iteration for nonlinear ill-posed problems in Banach spaces with uniformly convex penalty ⋮ Sequential Subspace Optimization for Recovering Stored Energy Functions in Hyperelastic Materials from Time-Dependent Data ⋮ An accelerated homotopy-perturbation-Kaczmarz method for solving nonlinear inverse problems ⋮ A projected Bouligand–Landweber iteration for non-smooth ill-posed problems

Uses Software

• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• 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.
• Sequential subspace optimization for nonlinear inverse problems
• Nonsmooth analysis
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms
• An iterative regularization method for nonlinear problems based on Bregman projections
• Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
• Inexact Newton–Landweber iteration for solving nonlinear inverse problems in Banach spaces
• A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
• Iterative regularization with a general penalty term—theory and application to L ¹ and TV regularization
• Nonlinear iterative methods for linear ill-posed problems in Banach spaces
• Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods
• Accelerated Landweber iteration in Banach spaces
• Fast regularizing sequential subspace optimization in Banach spaces
• Iterative methods for nonlinear ill-posed problems in Banach spaces: convergence and applications to parameter identification 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
• Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

This page was built for publication: Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms