{"title":"多集分裂可行性问题的惯性松弛CQ正则化新方法","authors":"Wenting Chen, Mei-xia Li","doi":"10.1117/12.2639062","DOIUrl":null,"url":null,"abstract":"The multiple-sets splitting feasibility problem (MSSFP) is the extension of splitting feasibility problem. This problem has been widely used in visual neural network and fuzzy image processing system. In this article, we offer the regularization methods of the inertial relaxed CQ algorithm, where the choice of parameters is not related to the operator norm. Under certain conditions, the weak convergence of the sequences is proved. In addition, the convergence of the algorithm is verified by numerical experiments.","PeriodicalId":336892,"journal":{"name":"Neural Networks, Information and Communication Engineering","volume":"61 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New inertial relaxed CQ regularization methods for the multiple-sets splitting feasibility problem\",\"authors\":\"Wenting Chen, Mei-xia Li\",\"doi\":\"10.1117/12.2639062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The multiple-sets splitting feasibility problem (MSSFP) is the extension of splitting feasibility problem. This problem has been widely used in visual neural network and fuzzy image processing system. In this article, we offer the regularization methods of the inertial relaxed CQ algorithm, where the choice of parameters is not related to the operator norm. Under certain conditions, the weak convergence of the sequences is proved. In addition, the convergence of the algorithm is verified by numerical experiments.\",\"PeriodicalId\":336892,\"journal\":{\"name\":\"Neural Networks, Information and Communication Engineering\",\"volume\":\"61 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neural Networks, Information and Communication Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2639062\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks, Information and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2639062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New inertial relaxed CQ regularization methods for the multiple-sets splitting feasibility problem
The multiple-sets splitting feasibility problem (MSSFP) is the extension of splitting feasibility problem. This problem has been widely used in visual neural network and fuzzy image processing system. In this article, we offer the regularization methods of the inertial relaxed CQ algorithm, where the choice of parameters is not related to the operator norm. Under certain conditions, the weak convergence of the sequences is proved. In addition, the convergence of the algorithm is verified by numerical experiments.