© 2016 IEEE. Sparse representation has been proven to be a powerful tool for analysis and processing of signals and images. Whereas the most existing sparse representation methods are based on the synthesis model, this paper addresses sparse representation with the so-called analysis model. The ℓ1/2-norm regularizer theory in compressive sensing (CS) shows that the ℓ1/2-norm regularizer can yield stronger sparsity-promoting solutions than the ℓ1-norm regularizer. In this paper, we propose a novel and efficient algorithm for analysis dictionary learning problem with ℓ1/2-norm regularizer as sparsity constraint, which includes two stages: the analysis sparse coding stage and the analysis dictionary update stage. In the analysis sparse coding stage, adaptive half-thresholding is employed to solve the ℓ1/2-norm regularizer problem. In the analysis dictionary update stage, the solution can be straightforwardly obtained by solving the related least square problem followed by a projection. According to our simulation study, the main advantage of the proposed algorithms is its greater learning efficiency in different cosparsities.