“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem

Q. L. Dong (), Y. C. Tang (), Y. J. Cho () and Th. M. Rassias ()
Additional contact information
Q. L. Dong: Civil Aviation University of China
Y. C. Tang: NanChang University
Y. J. Cho: University of Electronic Science and Technology of China
Th. M. Rassias: National Technical University of Athens

Journal of Global Optimization, 2018, vol. 71, issue 2, No 4, 360 pages

Abstract: Abstract In this paper, first, we review the projection and contraction methods for solving the split feasibility problem (SFP), and then by using the inverse strongly monotone property of the underlying operator of the SFP, we improve the “optimal” step length to provide the modified projection and contraction methods. Also, we consider the corresponding relaxed variants for the modified projection and contraction methods, where the two closed convex sets are both level sets of convex functions. Some convergence theorems of the proposed methods are established under suitable conditions. Finally, we give some numerical examples to illustrate that the modified projection and contraction methods have an advantage over other methods, and improve greatly the projection and contraction methods.

Keywords: Split feasibility problem; CQ method; Projection and contraction method; Modified projection and contraction method; Inverse strongly monotone; 47H05; 47H07; 47H10; 54H25 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-018-0628-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:71:y:2018:i:2:d:10.1007_s10898-018-0628-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-018-0628-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().