Optimization Online


Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming

Min Sun(ziyouxiaodou***at***163.com)
Hongchun Sun (sunhc68***at***126.com)

Abstract: For a type of multi-block separable convex programming raised in machine learning and statistical inference, we propose a proximal alternating direction method of multiplier (PADMM) with partially parallel splitting, which has the following nice properties: (1) To alleviate the weight of the proximal terms, the restrictions imposed on the proximal parameters are relaxed substantively; (2) To maintain the inherent structure of the primal variables xi(i = 1; 2; : : : ;m), the relaxation parameter is only attached to the update formula of the dual variable . For the resulted method, we establish its global convergence and worst-case O(1=t) convergence rate in an ergodic sense, where t is the iteration counter. Finally, two numerical examples are given to illustrate the theoretical results obtained.

Keywords: Alternating direction method of multipliers; multi-block separable convex programming; global convergence.

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )


Download: [PDF]

Entry Submitted: 07/09/2017
Entry Accepted: 07/09/2017
Entry Last Modified: 07/09/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society