咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Modified Proximal Point Algori... 收藏

Modified Proximal Point Algorithms for Solving Constrained Minimization and Fixed Point Problems in Complete CAT(0) Spaces

为解决的修改的近似的点算法抑制了最小化并且在完全的猫(0 ) 空格解决了点问题

作     者:Phuengrattana, Withun Onjai-uea, Nawitcha Cholamjiak, Prasit 

作者机构:Nakhon Pathom Rajabhat Univ Fac Sci & Technol Dept Math Nakhon Pathom 73000 Thailand Nakhon Pathom Rajabhat Univ Res & Dev Inst Res Ctr Pure & Appl Math Nakhon Pathom 73000 Thailand Univ Phayao Sch Sci Phayao 56000 Thailand 

出 版 物:《MEDITERRANEAN JOURNAL OF MATHEMATICS》 (地中海数学杂志)

年 卷 期:2018年第15卷第3期

页      面:97-97页

核心收录:

学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基  金:Thailand Research Fund Commission on Higher Education [MRG5980248] 

主  题:Convex minimization problem Fixed point problems Proximal point algorithm Nonexpansive mappings CAT(0) spaces 

摘      要:In this paper, we propose a new modified proximal point algorithm for a countably infinite family of nonexpansive mappings in complete CAT(0) spaces and prove strong convergence theorems for the proposed process under suitable conditions. We also apply our results to solving linear inverse problems and minimization problems. Several numerical examples are given to show the efficiency of the presented method.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分