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

From MaRDI portal
Revision as of 10:03, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
scientific article

    Statements

    The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets (English)
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    This paper continues the authors' investigation of the rate of convergence of cyclic projection algorithm. The rate of convergence depends on a definition of the angle between convex sets. The rate is related to the cosines of these angles. In particular, it is important to know when the cosine is less than 1. This paper shows when the angle can be expressed in terms of the norms of composites of best approximation operators (nonlinear) onto the convex sets. Conditions are given that assure the cosine of the angle is less than 1. [For Part II, cf. the authors, ibid. 142, No. 1, 56--82 (2006; Zbl 1109.41017).]
    0 references
    algorithms
    0 references
    convex sets
    0 references

    Identifiers