Abstract

The rate of convergence for the cyclic projections algorithm onto an intersection of finitely many closed convex sets in a Hilbert space is investigated. Recently we showed that this rate could be described in terms of the “angles” between the convex sets involved. Here we show that these angles may often be described in terms of the “norms” of certain nonlinear operators, and hence obtain an alternate way of computing this rate of convergence.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.