Lemma 5.1 — the while-loop of Algorithms MR and TL terminates, with $1-\eta_k\ge\min\{1-\bar\eta_k,\theta_{\min}\delta/(\Gamma\|F(x_k)\|)\}$

Initializing...

Lemma 5.1 — the while-loop of Algorithms MR and TL terminates, with $1-\eta_k\ge\min\{1-\bar\eta_k,\theta_{\min}\delta/(\Gamma\|F(x_k)\|)\}$ · Prove2Me