The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators

Francisco J. Aragón Artacho; Yair Censor; Aviv Gibali

doi:10.1080/10556788.2018.1504049

The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators

Francisco J. Aragón Artacho, Yair Censor, Aviv Gibali

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm.

Original language	English
Pages (from-to)	875-889
Number of pages	15
Journal	Optimization Methods and Software
Volume	34
Issue number	4
DOIs	https://doi.org/10.1080/10556788.2018.1504049
State	Published - 4 Jul 2019

Bibliographical note

Funding Information:
The f irst author was supported by MINECO of Spain and ERDF of EU, as part of the Ramón y Cajal program (RYC-2013-13327) and the Grant MTM2014-59179-C2-1-P. The second author’s work was supported by research grant no. 2013003 of the United States-Israel Binational Science Foundation (BSF). The third author’s work was supported by the EU FP7 IRSES program STREVCOMS, grant no. PIRSES-GA-2013-612669.

Publisher Copyright:
© 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group.

Keywords

Douglas–Rachford
feasibility problems
r-sets-Douglas–Rachford operator
reflections

ASJC Scopus subject areas

Software
Control and Optimization
Applied Mathematics

Access to Document

10.1080/10556788.2018.1504049

Cite this

@article{69c129e62b0b453281dfd38e8456d3b2,

title = "The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators",

abstract = "The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm.",

keywords = "Douglas–Rachford, feasibility problems, r-sets-Douglas–Rachford operator, reflections",

author = "{Arag{\'o}n Artacho}, {Francisco J.} and Yair Censor and Aviv Gibali",

note = "Funding Information: The f irst author was supported by MINECO of Spain and ERDF of EU, as part of the Ram{\'o}n y Cajal program (RYC-2013-13327) and the Grant MTM2014-59179-C2-1-P. The second author{\textquoteright}s work was supported by research grant no. 2013003 of the United States-Israel Binational Science Foundation (BSF). The third author{\textquoteright}s work was supported by the EU FP7 IRSES program STREVCOMS, grant no. PIRSES-GA-2013-612669. Publisher Copyright: {\textcopyright} 2018, {\textcopyright} 2018 Informa UK Limited, trading as Taylor & Francis Group.",

year = "2019",

month = jul,

day = "4",

doi = "10.1080/10556788.2018.1504049",

language = "English",

volume = "34",

pages = "875--889",

journal = "Optimization Methods and Software",

issn = "1055-6788",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators

AU - Aragón Artacho, Francisco J.

AU - Censor, Yair

AU - Gibali, Aviv

N1 - Funding Information: The f irst author was supported by MINECO of Spain and ERDF of EU, as part of the Ramón y Cajal program (RYC-2013-13327) and the Grant MTM2014-59179-C2-1-P. The second author’s work was supported by research grant no. 2013003 of the United States-Israel Binational Science Foundation (BSF). The third author’s work was supported by the EU FP7 IRSES program STREVCOMS, grant no. PIRSES-GA-2013-612669. Publisher Copyright: © 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group.

PY - 2019/7/4

Y1 - 2019/7/4

N2 - The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm.

AB - The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm.

KW - Douglas–Rachford

KW - feasibility problems

KW - r-sets-Douglas–Rachford operator

KW - reflections

UR - http://www.scopus.com/inward/record.url?scp=85052060907&partnerID=8YFLogxK

U2 - 10.1080/10556788.2018.1504049

DO - 10.1080/10556788.2018.1504049

M3 - Article

AN - SCOPUS:85052060907

SN - 1055-6788

VL - 34

SP - 875

EP - 889

JO - Optimization Methods and Software

JF - Optimization Methods and Software

IS - 4

ER -

The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this