Tight Coefficients of Averaged Operators via Scaled Relative Graph

Xinmeng Huang, Ernest K. Ryu, and Wotao Yin

Submitted:

Overview

Many iterative methods in optimization are fixed-point iterations with averaged operators. As such methods converge at an O(1/k) rate with the constant determined by the averagedness coefficient, establishing small averagedness coefficients for operators is of broad interest.

In this paper, we show that the averagedness coefficients of the composition of averaged operators by Ogura and Yamada (Numer Func Anal Opt 32(1–2):113–137, 2002) and the three-operator splitting by Davis and Yin (Set-Valued Var Anal 25(4):829–858, 2017) are tight. The analysis relies on the scaled relative graph, a geometric tool recently proposed by Ryu, Hannah, and Yin (arXiv:1902.09788, 2019).

Citation

X. Huang, E. Ryu, and W. Yin, Tight coefficients of averaged operators via scaled relative graph, arXiv:1912.01593, 2019.


« Back