Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions
From MaRDI portal
(Redirected from Publication:1789677)
Abstract: Conjugate Gradient (CG) methods are one of the most effective iterative methods to solve linear equations in Hilbert spaces. So far, they have been inherently bound to these spaces since they make use of the inner product structure. In more general Banach spaces one of the most prominent iterative solvers are Landweber-type methods that essentially resemble the Steepest Descent method applied to the normal equation. More advanced are subspace methods that take up the idea of a Krylov-type search space, wherein an optimal solution is sought. However, they do not share the conjugacy property with CG methods. In this article we propose that the Sequential Subspace Optimization (SESOP) method can be considered as an extension of CG methods to Banach spaces. We employ metric projections to orthogonalize the current search direction with respect to the search space from the last iteration. For the l2-space our method then exactly coincides with the Polak-Ribi`ere type of the CG method when applied to the normal equation. We show that such an orthogonalized search space still leads to weak convergence of the subspace method. Moreover, numerical experiments on a random matrix toy problem and 2D computerized tomography on lp-spaces show superior convergence properties over all p compared to non-orthogonalized search spaces. This especially holds for lp-spaces with small p. We see that the closer we are to an l2-space, the more we recover of the conjugacy property that holds in these spaces, i. e., as expected, the more the convergence behaves independently of the size of the truncated search space.
Recommendations
- Acceleration of the generalized Landweber method in Banach spaces via sequential subspace optimization
- Fast regularizing sequential subspace optimization in Banach spaces
- Sequential subspace optimization for nonlinear inverse problems
- A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification
- Conjugate gradient methods in Banach spaces
Cites work
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- A Subspace Study on Conjugate Gradient Algorithms
- A Taxonomy for Conjugate Gradient Methods
- An introduction to the mathematical theory of inverse problems
- Another nonlinear conjugate gradient algorithm for unconstrained optimization
- Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces
- Discrete inverse problems. Insight and algorithms.
- Fast regularizing sequential subspace optimization in Banach spaces
- Functional analysis. An introduction to metric spaces, Hilbert spaces, and Banach algebras
- Geometric properties of Banach spaces and nonlinear iterations
- scientific article; zbMATH DE number 3933857 (Why is no real title available?)
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 48239 (Why is no real title available?)
- scientific article; zbMATH DE number 3626044 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- scientific article; zbMATH DE number 3334516 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3187149 (Why is no real title available?)
- Iterative methods for nonlinear operator equations
- James orthogonality and orthogonal decompositions of Banach spaces
- Mathematical methods in image reconstruction
- Methods of conjugate gradients for solving linear systems
- Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods
- Nonlinear iterative methods for linear ill-posed problems in Banach spaces
- Numerical Optimization
- On the performance of algorithms for the minimization of ℓ 1 -penalized functionals
- Orthogonality in linear metric spaces
- Orthogonality in normed linear spaces
- Regularization methods in Banach spaces.
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- The N‐Step Iteration Procedures
- The regularizing properties of the adjoint gradient method in ill-posed problems
- Uniform convexity in factor and conjugate spaces
Cited in
(7)- A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
- Fast regularizing sequential subspace optimization in Banach spaces
- Acceleration of the generalized Landweber method in Banach spaces via sequential subspace optimization
- Sequential subspace optimization for nonlinear inverse 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
- An accelerated inexact Newton-type regularizing algorithm for ill-posed operator equations
This page was built for publication: Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789677)
