On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem-Reference-Cited by-同舟云学术

On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem

Published:2016 Issue:12 Volume:30 Page:3243-3252
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Dong Qiao-Li¹,He Songnian¹,Zhao Yanmin²

Affiliation:

1. Civil Aviation University of China, College of Science, Tianjin, China + Civil Aviation University of China, Tianjin Key Lab for Advanced Signal Processing, Tianjin, China

2. Xuchang University, School of Mathematical Sciences and Institute of Applied Mathematics, Xuchang, Henan, China

Abstract

In this paper, we introduce two fast projection algorithms for solving the multiple-sets split feasibility problem (MSFP). Our algorithms accelerate algorithms proposed in [8] and are proved to have a global convergence rate O(1=n2). Preliminary numerical experiments show that these algorithms are practical and promising.

Publisher

National Library of Serbia

Subject

General Mathematics

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A general hybrid relaxed CQ algorithm for solving the fixed-point problem and split-feasibility problem;AIMS Mathematics;2023

2. Self-adaptive algorithms for the split problem of the quasi-pseudocontractive operators in Hilbert spaces;AIMS Mathematics;2022

3. Ball-relaxed projection algorithms for multiple-sets split feasibility problem;Optimization;2021-03-29

4. Gradient methods with selection technique for the multiple-sets split feasibility problem;Optimization;2019-04-04