View Item 

Double projection algorithms for solving the split feasibility problems

Access Status
Open access
Authors
Dang, Y.Z.
Sun, Jie
Zhang, Su
Date
2019
Type
Journal Article

Metadata
Show full item record
Citation
Dang, Y.Z. and Sun, J. and Zhang, S. 2019. Double projection algorithms for solving the split feasibility problems. Journal of Industrial and Management Optimization. 15 (4): pp. 2023-2034.
Source Title
Journal of Industrial and Management Optimization
DOI
ISSN
Faculty
Faculty of Science and Engineering
School
School of Elec Eng, Comp and Math Sci (EECMS)
Funding and Sponsorship
Rights
URI
Collection
Abstract

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.

http://creativecommons.org/licenses/by/4.0/
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by/4.0/