Two generalizations of Dykstra's cyclic projections algorithm

MaRDI QIDQ1373762zbMATH OpenFDO

Authors F. Deutsch, Hein S. Hundal

Publication date 25 November 1997

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

zbMATH Keywords

best approximationsconvex feasibilityDykstra's cyclic projections algorithmfinite element methodHilbert spaceHildreth's algorithmsuccessive approximation

Mathematics Subject Classification ID

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

Recommendations

• A cyclic projection algorithm via duality
• scientific article; zbMATH DE number 878828
• Dykstra's alternating projection algorithm for two sets
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
• Results on the rate of convergence of the cyclic projections algorithm
• scientific article; zbMATH DE number 1174325
• scientific article; zbMATH DE number 617920

Cited in

(18)

• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• Successive approximate algorithm for best approximation from a polyhedron
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• 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
• Computational acceleration of projection algorithms for the linear best approximation problem
• Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
• Dykstras algorithm with bregman projections: A convergence proof
• Arbitrarily slow convergence of sequences of linear operators: a survey
• 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
• scientific article; zbMATH DE number 1174325 (Why is no real title available?)
• 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
• An acceleration scheme for Dykstra's algorithm
• Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373762)