解分裂凸可行性问题的Polyak梯度法及其应用

Journal of Applied and Numerical Optimization Pub Date : 1900-01-01 DOI:10.23952/jano.1.2019.2.05

A. Gibali, HA NGUYENH., N. T. Thuong, T. H. Trang, N. T. Vinh

{"title":"解分裂凸可行性问题的Polyak梯度法及其应用","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":"{\"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}","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

摘要

本文研究了实数Hilbert空间中一类分裂凸可行性问题的最小范数解。研究并分析了一种新的自适应CQ算法的收敛性。该算法的主要优点是不需要计算涉及算子的范数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Polyak’s gradient method for solving the split convex feasibility problem and its applications

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Applied and Numerical Optimization

自引率

0.00%

发文量