A. Gibali, HA NGUYENH., N. T. Thuong, T. H. Trang, N. T. Vinh
{"title":"Polyak’s gradient method for solving the split convex feasibility problem and its applications","authors":"A. Gibali, HA NGUYENH., N. T. Thuong, T. H. Trang, N. T. Vinh","doi":"10.23952/jano.1.2019.2.05","DOIUrl":null,"url":null,"abstract":"In this paper, we are concerned with the problem of finding minimum-norm solutions of a split convex feasibility problem in real Hilbert spaces. We study and analyze the convergence of a new self-adaptive CQ algorithm. The main advantage of the algorithm is that there is no need to calculate the norm of the involved operator.","PeriodicalId":205734,"journal":{"name":"Journal of Applied and Numerical Optimization","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Numerical Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23952/jano.1.2019.2.05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
In this paper, we are concerned with the problem of finding minimum-norm solutions of a split convex feasibility problem in real Hilbert spaces. We study and analyze the convergence of a new self-adaptive CQ algorithm. The main advantage of the algorithm is that there is no need to calculate the norm of the involved operator.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
