Optimization Online


Convergence analysis of the Peaceman-Rachford splitting method for nonsmooth convex optimization

Deren Han (handeren***at***njnu.edu.cn)
Xiaoming Yuan (xmyuan***at***hkbu.edu.hk)

Abstract: In this paper, we focus on the convergence analysis for the application of the Peaceman-Rachford splitting method to a convex minimization model whose objective function is the sum of a smooth and nonsmooth convex functions. The sublinear convergence rate in term of the worst-case O(1/t) iteration complexity is established if the gradient of the smooth objective function is assumed to be Lipschitz continuous; and the linear convergence rate is derived if this smooth function is further assumed to be strongly convex. A key technique to obtain these convergence rate results is that we use the primal-dual gap, rather than the objective function value to measure the accuracy of iterates. We also propose a modified Peaceman-Rachford splitting method for this convex minimization model which does not require to know the involved Lipschitz constant. Convergence analysis is conducted for this modified Peaceman-Rachford splitting method.

Keywords: Peaceman-Rachford splitting method, convex optimization, nonsmooth, iteration complexity, linear convergence rate

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )


Download: [PDF]

Entry Submitted: 11/27/2012
Entry Accepted: 11/27/2012
Entry Last Modified: 07/11/2013

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