In paper 'Local Identification of Overcomplete Dictionaries', the authors mentioned that one of the strong points of their results is that the corresponding maximisation algorithm ITKM (Iterative Thresholding and K signed Means) is locally successful, as demonstrated in several experiments, and computationally very efficient. The most complex step in each iteration is the matrix multiplication, which is even lighter than an iterative averaging algorithm described by another paper. Provide the full name of that paper.