The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets

DOI10.1016/J.JAT.2006.02.005zbMATH Open1109.41016OpenAlexW2100885264MaRDI QIDQ855483FDOQ855483

F. Deutsch, Hein S. Hundal

Publication date: 7 December 2006

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2006.02.005

Recommendations

• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• Results on the rate of convergence of the cyclic projections algorithm

zbMATH Keywords

algorithmsconvex sets

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Best approximation, Chebyshev systems (41A50)

Cites Work

• Principal component analysis.
• Error bounds for the method of alternating projections
• The rate of convergence for the method of alternating projections. II
• On Projection Algorithms for Solving Convex Feasibility Problems
• Theory of Reproducing Kernels
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• An alternating projection that does not converge in norm
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Best approximation in inner product spaces
• An Algorithm for Restricted Least Squares Regression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Sets and Nearest Points
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Improving the speed of convergence in the method of projections onto convex sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
• Restricted normal cones and the method of alternating projections: applications
• Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
• Title not available (Why is that?)
• Local linear convergence for alternating and averaged nonconvex projections
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• Stochastic first-order methods with random constraint projection
• A cyclic projection algorithm via duality
• Random algorithms for convex minimization problems
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Single-projection procedure for linear optimization
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• Projection methods for finding the greatest element of the intersection of max-closed convex sets
• Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
• The method of alternating relaxed projections for two nonconvex sets
• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• Characterizing arbitrarily slow convergence in the method of alternating projections
• Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
• Structure-Preserving Function Approximation via Convex Optimization
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
• Results on the rate of convergence of the cyclic projections algorithm

This page was built for publication: The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets

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