{"title":"一种新的步长梯度投影方法用于分割可行性问题。","authors":"Pattanapong Tianchai","doi":"10.1186/s13660-018-1712-0","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper, we introduce an iterative scheme using the gradient projection method with a new step size, which is not depend on the related matrix inverses and the largest eigenvalue (or the spectral radius of the self-adjoint operator) of the related matrix, based on Moudafi's viscosity approximation method for solving the <i>split feasibility problem</i> (SFP), which is to find a point in a given closed convex subset of a real Hilbert space such that its image under a bounded linear operator belongs to a given closed convex subset of another real Hilbert space. We suggest and analyze this iterative scheme under some appropriate conditions imposed on the parameters such that another strong convergence theorems for the SFP are obtained. The results presented in this paper improve and extend the main results of Tian and Zhang (J. Inequal. Appl. 2017:Article ID 13, 2017), and Tang et al. (Acta Math. Sci. 36B(2):602-613, 2016) (in a single-step regularized method) with a new step size, and many others. The examples of the proposed SFP are also shown through numerical results.</p>","PeriodicalId":49163,"journal":{"name":"Journal of Inequalities and Applications","volume":"2018 1","pages":"120"},"PeriodicalIF":1.6000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13660-018-1712-0","citationCount":"2","resultStr":"{\"title\":\"Gradient projection method with a new step size for the split feasibility problem.\",\"authors\":\"Pattanapong Tianchai\",\"doi\":\"10.1186/s13660-018-1712-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In this paper, we introduce an iterative scheme using the gradient projection method with a new step size, which is not depend on the related matrix inverses and the largest eigenvalue (or the spectral radius of the self-adjoint operator) of the related matrix, based on Moudafi's viscosity approximation method for solving the <i>split feasibility problem</i> (SFP), which is to find a point in a given closed convex subset of a real Hilbert space such that its image under a bounded linear operator belongs to a given closed convex subset of another real Hilbert space. We suggest and analyze this iterative scheme under some appropriate conditions imposed on the parameters such that another strong convergence theorems for the SFP are obtained. The results presented in this paper improve and extend the main results of Tian and Zhang (J. Inequal. Appl. 2017:Article ID 13, 2017), and Tang et al. (Acta Math. Sci. 36B(2):602-613, 2016) (in a single-step regularized method) with a new step size, and many others. The examples of the proposed SFP are also shown through numerical results.</p>\",\"PeriodicalId\":49163,\"journal\":{\"name\":\"Journal of Inequalities and Applications\",\"volume\":\"2018 1\",\"pages\":\"120\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/s13660-018-1712-0\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Inequalities and Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1186/s13660-018-1712-0\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2018/5/18 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Inequalities and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1186/s13660-018-1712-0","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/5/18 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2
摘要
本文基于Moudafi的黏度近似法,提出了一种不依赖于相关矩阵逆和相关矩阵的最大特征值(或自伴随算子的谱半径)的梯度投影迭代方案。即在实希尔伯特空间的给定闭凸子集中找到一个点,使得它在有界线性算子下的像属于另一个实希尔伯特空间的给定闭凸子集。在适当的参数条件下,我们提出并分析了该迭代格式,从而得到了SFP的另一个强收敛定理。本文的结果改进和推广了Tian和Zhang (J. Inequal)的主要结果。applied . 2017:Article ID 13, 2017), and Tang et al. (Acta Math.)科学通报,2016,36(2):602-613)(在单步正则化方法中)使用新的步长,以及许多其他方法。最后,通过数值结果给出了所提SFP的算例。
Gradient projection method with a new step size for the split feasibility problem.
In this paper, we introduce an iterative scheme using the gradient projection method with a new step size, which is not depend on the related matrix inverses and the largest eigenvalue (or the spectral radius of the self-adjoint operator) of the related matrix, based on Moudafi's viscosity approximation method for solving the split feasibility problem (SFP), which is to find a point in a given closed convex subset of a real Hilbert space such that its image under a bounded linear operator belongs to a given closed convex subset of another real Hilbert space. We suggest and analyze this iterative scheme under some appropriate conditions imposed on the parameters such that another strong convergence theorems for the SFP are obtained. The results presented in this paper improve and extend the main results of Tian and Zhang (J. Inequal. Appl. 2017:Article ID 13, 2017), and Tang et al. (Acta Math. Sci. 36B(2):602-613, 2016) (in a single-step regularized method) with a new step size, and many others. The examples of the proposed SFP are also shown through numerical results.
期刊介绍:
The aim of this journal is to provide a multi-disciplinary forum of discussion in mathematics and its applications in which the essentiality of inequalities is highlighted. This Journal accepts high quality articles containing original research results and survey articles of exceptional merit. Subject matters should be strongly related to inequalities, such as, but not restricted to, the following: inequalities in analysis, inequalities in approximation theory, inequalities in combinatorics, inequalities in economics, inequalities in geometry, inequalities in mechanics, inequalities in optimization, inequalities in stochastic analysis and applications.