검색 상세

Convergence Analysis of Alternating Direction Method of Multipliers for Convex Optimization

초록/요약

There are many algorithms to solve problems with a large data set. The larger the size of the data, the longer computational time to run. Also, it is hard to find whether a problem is well-posed if its algorithm is not guaranteed to terminate in finite time. Hence it is natural to study the convergence of algorithm. In this thesis, we prove the convergence of Alternating Direction Method of Multipliers (ADMM) under general assumptions. Finally, we attach the numerical experiments for ADMM, which work well.

more