Two generalizations of Dykstra's cyclic projections algorithm

zbMath0891.90164MaRDI QIDQ1373762

Frank Deutsch, Hein S. Hundal

Publication date: 25 November 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

finite element methodHilbert spacesuccessive approximationbest approximationsconvex feasibilityHildreth's algorithmDykstra's cyclic projections algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Programming in abstract spaces (90C48)

Related Items (14)

Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey ⋮ The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators ⋮ Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence ⋮ Convergence Rate Analysis of a Dykstra-Type Projection Algorithm ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes ⋮ The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\) ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Fenchel duality and the strong conical hull intersection property ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions

This page was built for publication: Two generalizations of Dykstra's cyclic projections algorithm