A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems

ABSTRACT

The Peaceman–Rachford splitting method (PRSM) is well studied for solving the two-block separable convex minimization problems with linear constraints recently. In this paper, we consider the separable convex minimization problem where its objective function is the sum of more than two functions without coupled variables, when applying the PRSM to this case directly, it is not necessarily convergent. To remedy this difficulty, we propose a proximal Peaceman–Rachford splitting method for solving this multi-block separable convex minimization problems, which updates the Lagrangian multiplier two times at each iteration and solves some subproblems parallelly. Under some mild conditions, we prove global convergence of the new method and analyse the worst-case convergence rate in both ergodic and nonergodic senses. In addition, we apply the new method to solve the robust principal component analysis problem and report some preliminary numerical results to indicate the feasibility and effectiveness of the proposed method.

Keywords:

• Convex programming
• multi-block
• separable structure
• Peaceman–Rachford splitting method
• global convergence

2010 AMS Subject Classifications:

• 90C25
• 65K05
• 49M27

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant numbers 11771078, 71390335 and 71661147004].