Fast Alternating Direction Multipliers Method by Generalized Krylov Subspaces

The Alternating Direction Multipliers Method (ADMM) is a very popular and powerful algorithm for the solution of many optimization problems. In the recent years it has been widely used for the solution of ill-posed inverse problems. However, one of its drawback is the possibly high computational cost, since at each iteration, it requires the solution of a large-scale least squares problem. In this work we propose a computationally attractive implementation of ADMM, with particular attention to ill-posed inverse problems. We significantly decrease the computational cost by projecting the original large scale problem into a low-dimensional subspace by means of Generalized Krylov Subspaces (GKS). The dimension of the projection space is not an additional parameter of the method as it increases with the iterations. The construction of GKS allows for very fast computations, regardless of the increasing size of the problem. Several computed examples show the good performances of the proposed method