Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions

DOI10.1016/j.cam.2018.05.049zbMath1458.65062arXiv1602.04036OpenAlexW2266541847MaRDI QIDQ1789677

Frederik Heber, Frank Schöpfer, Thomas Schuster

Publication date: 10 October 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04036

zbMATH Keywords

computerized tomographyBanach spacemetric projectionBregman distancesequential subspace optimizationconjugate gradient normal error method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items

A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems ⋮ Inverse problems with inexact forward operator: iterative regularization and application in dynamic imaging ⋮ An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems

Uses Software

• Eigen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularization methods in Banach spaces.
• Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces
• Iterative methods for nonlinear operator equations
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Geometric properties of Banach spaces and nonlinear iterations
• James orthogonality and orthogonal decompositions of Banach spaces
• Orthogonality in linear metric spaces
• Uniform convexity in factor and conjugate spaces
• Mathematical Methods in Image Reconstruction
• A Taxonomy for Conjugate Gradient Methods
• 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
• Fast regularizing sequential subspace optimization in Banach spaces
• Another nonlinear conjugate gradient algorithm for unconstrained optimization
• On the performance of algorithms for the minimization of ℓ ₁ -penalized functionals
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Numerical Optimization
• The regularizing properties of the adjoint gradient method in ill-posed problems
• A Subspace Study on Conjugate Gradient Algorithms
• Discrete Inverse Problems
• Functional Analysis
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures
• An introduction to the mathematical theory of inverse problems
• Orthogonality in normed linear spaces