Nonasymptotic and asymptotic linear convergence of an almost cyclic SHQP Dykstra's algorithm for polyhedral problems

Abstract

We show that an almost cyclic (or generalized Gauss- Seidel) Dykstra's algorithm which incorporates the SHQP (supporting halfspace- quadratic programming) strategy can achieve nonasymptotic and asymptotic linear convergence for polyhedral problems.

26 pages

Cited by in corpus (1)

• Linear convergence of dual coordinate descent on non-polyhedral convex problems