From many fewer acquired measurements than that suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that a signal can be reconstructed with high probability when it exhibits sparsity in a certain domain. Recent CS methods have employed analytical sparsifying transforms such as wavelets, curvelets, and finite differences. In this paper, we propose a novel algorithm for image recovery, which minimizes a linear combination of three terms corresponding to least square data fitting, adaptive dictionary, and Hessian Schatten-norm regularization. We split the problem into some subproblems which turn the minimization task into much simpler. Numerical experiments are conducted on several test images with a variety of sampling patterns and ratios in both noiseless and noise scenarios. The results demonstrate the superior performance of the proposed algorithm.