“…Then, for z 0 = (x 0 , x −1 ) sufficiently close to z * , any algorithm that satisfies (H1) and (H2) and starts at z 0 generates a sequence that remains in a neighborhood of z * , has the finite length property, and converges to a pointz = (x,x) withx ∈ M i=1 S i . Finally, we complement our local convergence result by the convergence rate estimates from [24,33]. Assuming the objective function is semi-algebraic, in [24, Theorems 2 and 4] which build on [22,Theorem 3.4], a list of qualitative convergence rate estimates in terms of the KL-exponent is proved.…”