the alternating direction method of multipliers (admm) has been successfully used in solving problems arising from different fields such as machine learning, image processing, statistics and so on. however, most existing works on analyzing the convergence and complexity of admm are for convex problems. in this talk, we discuss several recent results on convergence behavior of admm for solving nonconvex problems. we consider two nonconvex models. the first model allows the objective function to be nonconvex and nonsmooth, but the constraints are convex. the second model allows the constraints to be riemannian manifolds. for both models, we propose admm variants for solving them and analyze their iteration complexities for obtaining an $\epsilon$-stationary solution. numerical results on tensor robust pca, maximum bisection problem and community detection problem are reported to demonstrate the efficiency of the proposed methods.