Double projection algorithms for solving the split feasibility problems

Double projection algorithms for solving the split feasibility problems

We propose two new double projection algorithms for solving the split feasibility problem (SFP). Different from the extragradient projection algorithms, the proposed algorithms do not require fixed stepsize and do not employ the same projection region at different projection steps. We adopt flexible...

Full description

Bibliographic Details
Main Authors: Dang, Y.Z., Sun, Jie, Zhang, Su
Format: Journal Article
Language:English
Published: AMER INST MATHEMATICAL SCIENCES-AIMS 2019
Subjects:
Science & Technology
Technology
Physical Sciences
Engineering, Multidisciplinary
Operations Research & Management Science
Mathematics, Interdisciplinary Applications
Engineering
Mathematics
Armijo-type line search
convergence analysis
double projection algorithm
optimization
split feasibility problem
EXTRAGRADIENT METHOD
CQ ALGORITHM
SETS
Online Access:http://purl.org/au-research/grants/arc/DP160102819
http://hdl.handle.net/20.500.11937/90788
Description
Summary:We propose two new double projection algorithms for solving the split feasibility problem (SFP). Different from the extragradient projection algorithms, the proposed algorithms do not require fixed stepsize and do not employ the same projection region at different projection steps. We adopt flexible rules for selecting the stepsize and the projection region. The proposed algorithms are shown to be convergent under certain assumptions. Numerical experiments show that the proposed methods appear to be more efficient than the relaxed- CQ algorithm.

Similar Items