I don&#x27;t really see a compelling case for this method. The empirical convergence rates are clearly polynomial, while subspace iteration (e.g., Krylov) are &quot;in theory&quot; exponential and in practice pretty good. There is a bit of hand-waving about why Kyrlov methods are not as good (the theory is supposedly not robust to noise), but the techniques for robustifying Krylov-type subspace iterations, such as restarts, are pretty mature.<p>More than that, the method actually appears to be an iterative &quot;prox&quot; method. These things are very well studied in the convex analysis literature. I wouldn&#x27;t be surprised if this already appears as a special case of an algorithm in the literature somewhere.