The rate of convergence for the method of alternating projections. II (Q1353696): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jmaa.1997.5202 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052610157 / rank
 
Normal rank

Revision as of 20:33, 19 March 2024

scientific article
Language Label Description Also known as
English
The rate of convergence for the method of alternating projections. II
scientific article

    Statements

    The rate of convergence for the method of alternating projections. II (English)
    0 references
    0 references
    0 references
    6 July 1998
    0 references
    [For Part I see \textit{F. Deutsch}, Parametric optimization and approximation, Conf. Oberwolfach 1983, ISNM 72, 96-107 (1985; Zbl 0575.65049).] The authors give a very useful, easily computable error bound for the method of alternating projections. They also show that any error bound, which only depends on the angles between the various subspaces involved, can never be sharp. A counter-example to a conjecture of \textit{S. Kayalar} and \textit{H. L. Weinert} [Math. Control Signals Syst. 1, No. 1, 43-59 (1988; Zbl 0673.65036)] is also given.
    0 references
    convergence
    0 references
    error bound
    0 references
    method of alternating projections
    0 references
    counter-example
    0 references

    Identifiers