ON THE FINITE CONVERGENCE OF THE DOUGLAS-RACHFORD ALGORITHM FOR SOLVING (NOT NECESSARILY CONVEX) FEASIBILITY PROBLEMS IN EUCLIDEAN SPACES

被引：16
|
作者：
Bauschke, Heinz H. [1 ]
Dao, Minh N. [2 ,3 ]
机构：
[1] Univ British Columbia, Math, Kelowna, BC V1V 1V7, Canada
[2] Univ Newcastle, CARMA, Callaghan, NSW 2308, Australia
[3] Hanoi Natl Univ Educ, Dept Math & Informat, 136 Xuan Thuy, Hanoi, Vietnam
来源：
SIAM JOURNAL ON OPTIMIZATION | 2017年 / 27卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
averaged alternating reflections; Douglas-Rachford algorithm; epigraph; feasibility problem; finite convergence; global convergence; halfspace; polyhedron; projector; reflector; ALTERNATING PROJECTIONS; LINEAR CONVERGENCE;
D O I：
10.1137/16M1071079
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Solving feasibility problems is a central task in mathematics and the applied sciences. One particularly successful method is the Douglas-Rachford algorithm. In this paper, we provide many new conditions sufficient for finite convergence. Numerous examples illustrate our results.
引用
收藏
页码：507 / 537
页数：31
相关论文
共 50 条
  • [41] PRECONDITIONED DOUGLAS-RACHFORD SPLITTING METHODS FOR CONVEX-CONCAVE SADDLE-POINT PROBLEMS
    Bredies, Kristian
    Sun, Hongpeng
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2015, 53 (01) : 421 - 444
  • [42] On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets
    Das Gupta, Shuvomoy
    [J]. 2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 56 - 63
  • [43] Douglas-Rachford algorithm for control- and state-constrained optimal control problems
    Burachik, Regina S.
    Caldwell, Bethany I.
    Kaya, C. Yalcin
    [J]. AIMS MATHEMATICS, 2024, 9 (06): : 13874 - 13893
  • [44] Douglas-Rachford algorithm for control-constrained minimum-energy control problems
    Burachik, Regina S.
    Caldwell, Bethany I.
    Yalcin Kaya, C.
    [J]. ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2024, 30
  • [45] CONVERGENCE ANALYSIS OF A PARALLEL PROJECTION ALGORITHM FOR SOLVING CONVEX FEASIBILITY PROBLEMS
    Dang, Yazheng
    Meng, Fanwen
    Sun, Jie
    [J]. NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2016, 6 (04): : 505 - 519
  • [46] An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm
    Francisco J. Aragón Artacho
    Rubén Campoy
    Veit Elser
    [J]. Journal of Global Optimization, 2020, 77 : 383 - 403
  • [47] Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
    Chang, Shih-sen
    Kim, Jong Kyu
    Wang, Xiong Rui
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2010,
  • [48] Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
    Shih-sen Chang
    JongKyu Kim
    XiongRui Wang
    [J]. Journal of Inequalities and Applications, 2010
  • [49] PRECONDITIONED DOUGLAS-RACHFORD TYPE PRIMAL-DUAL METHOD FOR SOLVING COMPOSITE MONOTONE INCLUSION PROBLEMS WITH APPLICATIONS
    Yang, Yixuan
    Tang, Yuchao
    Wen, Meng
    Zeng, Tieyong
    [J]. INVERSE PROBLEMS AND IMAGING, 2021, 15 (04) : 787 - 825
  • [50] Solving stochastic convex feasibility problems in Hilbert spaces
    Crombez, G
    [J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1996, 17 (9-10) : 877 - 892
12345