CSpace
A new hybrid algorithm for a nonexpansive mapping
Dong,Qiao-Li1,2; Lu,Yan-Yan1
2015-03-07
Source PublicationFixed Point Theory and Applications
ISSN1687-1812
Volume2015Issue:1
AbstractAbstractIn the paper, we introduce a new hybrid algorithm which is not based on the modification to weak convergence algorithms. The strong convergence theorem of the proposed algorithm is presented. Finally, the numerical experiments suggest that the new algorithm could be faster than Nakajo and Takahashi’s algorithm in J. Math. Anal. Appl. 279:372-379, 2003.
Keywordnonexpansive mapping Mann’s iteration hybrid algorithm strong convergence 90C47 49J35
DOI10.1186/s13663-015-0285-6
Language英语
WOS IDBMC:10.1186/s13663-015-0285-6
PublisherSpringer International Publishing
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/336
Collection中国科学院数学与系统科学研究院
Corresponding AuthorDong,Qiao-Li
Affiliation1.Civil Aviation University of China; College of Science
2.Civil Aviation University of China; Tianjin Key Lab for Advanced Signal Processing
Recommended Citation
GB/T 7714
Dong,Qiao-Li,Lu,Yan-Yan. A new hybrid algorithm for a nonexpansive mapping[J]. Fixed Point Theory and Applications,2015,2015(1).
APA Dong,Qiao-Li,&Lu,Yan-Yan.(2015).A new hybrid algorithm for a nonexpansive mapping.Fixed Point Theory and Applications,2015(1).
MLA Dong,Qiao-Li,et al."A new hybrid algorithm for a nonexpansive mapping".Fixed Point Theory and Applications 2015.1(2015).
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Dong,Qiao-Li]'s Articles
[Lu,Yan-Yan]'s Articles
Baidu academic
Similar articles in Baidu academic
[Dong,Qiao-Li]'s Articles
[Lu,Yan-Yan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Dong,Qiao-Li]'s Articles
[Lu,Yan-Yan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.