The worst-case first-step error of cyclic alternating projections equals a maximum of a product of adjacent off-diagonal matrix entries, with exact value f_3(c)=4c^2 for c<=1/4 and f_3(c)=c for c>=1/4, and optimal slope 2(n-1)sin^2(pi/(2n)) near c=1 for all n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.FA 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On the optimal error bound for the first step in the method of cyclic alternating projections
The worst-case first-step error of cyclic alternating projections equals a maximum of a product of adjacent off-diagonal matrix entries, with exact value f_3(c)=4c^2 for c<=1/4 and f_3(c)=c for c>=1/4, and optimal slope 2(n-1)sin^2(pi/(2n)) near c=1 for all n.