Bounded Perturbation Resilience of Two Modified Relaxed CQ Algorithms for the Multiple-Sets Split Feasibility Problem

Bounded Perturbation Resilience of Two Modified Relaxed CQ Algorithms for the Multiple-Sets Split Feasibility Problem

In this paper, we present some modified relaxed CQ algorithms with different kinds of step size and perturbation to solve the Multiple-sets Split Feasibility Problem (MSSFP). Under mild assumptions, we establish weak convergence and prove the bounded perturbation resilience of the proposed algorithm...

Full description

Bibliographic Details
Main Authors: Yingying Li, Yaxuan Zhang
Format: Article
Language:English
Published: MDPI AG 2021-08-01
Series:Axioms
Subjects:
multiple-sets split feasibility problem
CQ algorithm
bounded perturbation
armijo-line search
self-adaptive step size
Online Access:https://www.mdpi.com/2075-1680/10/3/197

Internet

https://www.mdpi.com/2075-1680/10/3/197

Similar Items