On global and local convergence of half-quadratic algorithms
This study gives original results on the global and local convergence properties of half-quadratic (HQ) algorithms resulting from the Geman and Yang (GY) and Geman and Reynolds (GR) primal-dual constructions. In particular, we show that the: convergence domain of the GY algorithm can be extended with the benefit of an improved convergence rate.