A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints

Deren Han, Hongjin He, Hai Yang, Xiaoming YUAN*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)

Abstract

We consider applying the Douglas-Rachford splitting method (DRSM) to the convex minimization problem with linear constraints and a separable objective function. The dual application of DRSM has been well studied in the literature, resulting in the well known alternating direction method of multipliers (ADMM). In this paper, we show that the primal application of DRSM in combination with an appropriate decomposition can yield an efficient structure-exploiting algorithm for the model under consideration, whose subproblems could be easier than those of ADMM. Both the exact and inexact versions of this customized DRSM are studied; and their numerical efficiency is demonstrated by some preliminary numerical results.

Original languageEnglish
Pages (from-to)167-200
Number of pages34
JournalNumerische Mathematik
Volume127
Issue number1
DOIs
Publication statusPublished - May 2014

Scopus Subject Areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints'. Together they form a unique fingerprint.

Cite this