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

DOI10.1016/J.JAT.2006.02.005MaRDI QIDQ855483zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

algorithmsconvex sets

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3951877 (Why is no real title available?)
• scientific article; zbMATH DE number 3973706 (Why is no real title available?)
• scientific article; zbMATH DE number 52645 (Why is no real title available?)
• scientific article; zbMATH DE number 3498726 (Why is no real title available?)
• scientific article; zbMATH DE number 1009689 (Why is no real title available?)
• scientific article; zbMATH DE number 878830 (Why is no real title available?)
• scientific article; zbMATH DE number 3229228 (Why is no real title available?)
• scientific article; zbMATH DE number 3063308 (Why is no real title available?)
• An Algorithm for Restricted Least Squares Regression
• An alternating projection that does not converge in norm
• Best approximation in inner product spaces
• Convex Sets and Nearest Points
• Error bounds for the method of alternating projections
• Improving the speed of convergence in the method of projections onto convex sets
• On Projection Algorithms for Solving Convex Feasibility Problems
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• Principal component analysis.
• The method of alternating projections and the method of subspace corrections in Hilbert space
• 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
• The rate of convergence for the method of alternating projections. II
• Theory of Reproducing Kernels

Cited in

(32)

• Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
• Results on the rate of convergence of the cyclic projections algorithm
• A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
• An acceleration scheme for cyclic subgradient projections method
• Restricted normal cones and the method of alternating projections: applications
• Weak, strong, and linear convergence of a double-layer fixed point algorithm
• Structure-preserving function approximation via convex optimization
• scientific article; zbMATH DE number 2033473 (Why is no real title available?)
• Randomized projection methods for convex feasibility: conditioning and convergence rates
• Local linear convergence for alternating and averaged nonconvex projections
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• On angles between convex sets in Hilbert spaces
• 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
• Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
• Single-projection procedure for linear optimization
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• Polynomial estimates for the method of cyclic projections in Hilbert spaces
• The method of alternating relaxed projections for two nonconvex sets
• Projection methods for finding the greatest element of the intersection of max-closed convex sets
• The rate of convergence in the method of alternating projections
• Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
• 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
• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• Angle criteria for uniform convergence of averaged projections and cyclic or random products of projections
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Unconstrained optimization techniques for the acceleration of alternating projection methods
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations

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)