Optimization Online


New Douglas-Rachford algorithmic structures and their convergence analyses

Ysir Censor(yair***at***math.haifa.ac.il)
Rafiq Mansour(intogral***at***gmail.com)

Abstract: In this paper we study new algorithmic structures with Douglas- Rachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic operator into the String-Averaging Projections (SAP) and into the Block-Iterative Pro- jection (BIP) algorithmic structures, thereby creating new DR algo- rithmic schemes that include the recently proposed cyclic Douglas- Rachford algorithm and the averaged DR algorithm as special cases. We further propose and investigate a new multiple-set-DR algorithmic operator. Convergence of all these algorithmic schemes is studied by using properties of strongly quasi-nonexpansive operators and firmly nonexpansive operators.

Keywords: Douglas-Rachford operator, string-averaging, block-iterative.

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: SIAM Journal on Optimization, accepted for publication.

Download: [PDF]

Entry Submitted: 12/01/2015
Entry Accepted: 12/01/2015
Entry Last Modified: 12/01/2015

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