{"title":"A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings","authors":"Yasir Arfat, P. Kumam, M. A. A. Khan, Y. Cho","doi":"10.37193/cjm.2023.01.21","DOIUrl":null,"url":null,"abstract":"In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the proposed algorithm with possible applications.","PeriodicalId":50711,"journal":{"name":"Carpathian Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Carpathian Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37193/cjm.2023.01.21","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the proposed algorithm with possible applications.
期刊介绍：
Carpathian Journal of Mathematics publishes high quality original research papers and survey articles in all areas of pure and applied mathematics. It will also occasionally publish, as special issues, proceedings of international conferences, generally (co)-organized by the Department of Mathematics and Computer Science, North University Center at Baia Mare. There is no fee for the published papers but the journal offers an Open Access Option to interested contributors.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
