Introduction - If you have any usage issues, please Google them yourself
ADMM method for solving linear constrained convex optimization problem is effective. In this paper, we propose a near linear algorithm, homotopy method used to solve the problem of sub-point of each iteration. Under appropriate conditions, the global convergence and convergence rate is the worst case of the proposed algorithm is proved. The numerical results show that an initial validity of the proposed method.