Inexact Averaged Projection Algorithm for Nonconvex Multiple-Set Split Feasibility Problems
Received:May 07, 2019  Revised:September 04, 2019
Key Word: multiple-set split feasibility problem   averaged projections   Kurdyka-\L ojasiewicz inequality  
Fund ProjectL:Supported by the Natural Natural Science Foundation of China (Grant Nos.11801455; 11971238), China Postdoctoral Science Foundation (Grant No.2019M663459), the Applied Basic Project of Sichuan Province (Grant No.20YYJC2523) and the Fundamental Research Funds of China West Normal University (Grant Nos.17E084; 18B031).
Author NameAffiliation
Ke GUO School of Mathematics and Information, China West Normal University, Sichuan 637002, P. R. China 
Chunrong ZHU School of Mathematics and Information, China West Normal University, Sichuan 637002, P. R. China 
Hits: 32
Download times: 0
Abstract:
      In this paper, we introduce an inexact averaged projection algorithm to solve the nonconvex multiple-set split feasibility problem, where the involved sets are semi-algebraic prox-regular sets. By means of the well-known Kurdyka-\L ojasiewicz inequality, we establish the convergence of the proposed algorithm.
Citation:
DOI:10.3770/j.issn:2095-2651.2020.05.009
View Full Text  View/Add Comment  Download reader