Computational acceleration of projection algorithms for the linear best approximation problem
From MaRDI portal
Publication:2497243
DOI10.1016/J.LAA.2005.10.006zbMath1100.65050OpenAlexW2106162327MaRDI QIDQ2497243
Publication date: 4 August 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.10.006
numerical examplesconvex feasibility problemDykstra's algorithmHalpern-Lions-Wittmann-Bauschke algorithmsequential projection algorithmssimultaneous projection algorithms
Related Items (11)
Finding a best approximation pair of points for two polyhedra ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ How good are projection methods for convex feasibility problems? ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Common solutions to variational inequalities ⋮ On the incomplete oblique projections method for solving box constrained least squares problems ⋮ An acceleration scheme for Dykstra's algorithm ⋮ A generalized iterative method and comparison results using projection techniques for solving linear systems ⋮ Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space ⋮ Finding best approximation pairs for two intersections of closed convex sets ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- An iterative procedure for obtaining I-projections onto the intersection of convex sets
- A cyclic projection algorithm via duality
- Strong convergence theorems for resolvents of accretive operators in Banach spaces
- On the convergence of Han's method for convex programming with quadratic objective
- Approximation of fixed points of nonexpansive mappings
- A successive projection method
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
- Two generalizations of Dykstra's cyclic projections algorithm
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Dual coordinate ascent methods for non-strictly convex minimization
- Convergence of approximants to fixed points of nonexpansive nonlinear mappings in Banach spaces
- On rings of operators. Reduction theory
- Dykstras algorithm with bregman projections: A convergence proof
- An Algorithm for Restricted Least Squares Regression
- On Diagonally Relaxed Orthogonal Projection Methods
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A Parallel Algorithm for a Class of Convex Programs
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Finding projections onto the intersection of convex sets in hilbert spaces
- Primal and polar approach for computing the symmetric diagonally dominant projection
- Robust Stopping Criteria for Dykstra's Algorithm
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Fixed points of nonexpanding maps
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Best approximation in inner product spaces
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
This page was built for publication: Computational acceleration of projection algorithms for the linear best approximation problem
