Unconstrained optimization techniques for the acceleration of alternating projection methods
From MaRDI portal
Recommendations
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Acceleration schemes for the method of alternating projections
- A new geometric acceleration of the von Neumann-Halperin projection method
- Relaxed Alternating Projection Methods
- Accelerating the convergence of the method of alternating projections
Cites work
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- A Block Projection Method for Sparse Matrices
- Accelerating the convergence of the method of alternating projections
- Acceleration schemes for the method of alternating projections
- Alternating oblique projections for coupled linear systems
- Computational acceleration of projection algorithms for the linear best approximation problem
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Decomposition through formalization in a product space
- Error bounds for the method of alternating projections
- Functional analysis.
- Fundamentals of Computerized Tomography
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Numerical solution of saddle point problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Steepest Descent for Singular Linear Operator Equations
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Strong convergence of expected-projection methods in hilbert spaces
- The method of projections for finding the common point of convex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Two-Point Step Size Gradient Methods
Cited in
(8)- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Objective acceleration for unconstrained optimization
- An acceleration scheme for Dykstra's algorithm
- Accelerating the convergence of the method of alternating projections via a line search: A brief survey
- Accelerated double direction method for solving unconstrained optimization problems
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
- Acceleration schemes for the method of alternating projections
This page was built for publication: Unconstrained optimization techniques for the acceleration of alternating projection methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114578)