recent developments in numerical optimization show that the augmented lagrangian method (alm) is very effective in solving large scale convex semidefinite programming. due to the possible lack of primal-dual-type error bounds, it was not clear whether the karush–kuhn–tucker (kkt) residuals of the sequence generated by the alm for solving convex semidefinite programming converge superlinearly. we resolve this issue by establishing the r-superlinear convergence of the kkt residuals generated by the alm under only a mild dual-type error bound condition, for which neither the primal nor the dual solution is required to be unique.