On Simplifying the Pirmal-Dual Method of Multipliers

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016, pp. 4826 - 4830
Issue Date:
2016-03-20
Full metadata record
Files in This Item:
Filename Description Size
07472594.pdfPublished version171.05 kB
Adobe PDF
Recently, the primal-dual method of multipliers (PDMM) has been proposed to solve a convex optimization problem defined over a general graph. In this paper, we consider simplifying PDMM for a subclass of the convex optimization problems. This subclass includes the consensus problem as a special form. By using algebra, we show that the update expressions of PDMM can be simplified significantly. We then evaluate PDMM for training a support vector machine (SVM). The experimental results indicate that PDMM converges considerably faster than the alternating direction method of multipliers (ADMM).
Please use this identifier to cite or link to this item: