关于凸可行性问题

L. Măruşter, Ş. Măruşter
{"title":"关于凸可行性问题","authors":"L. Măruşter, Ş. Măruşter","doi":"10.1109/ITI.2004.242702","DOIUrl":null,"url":null,"abstract":"In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On convex feasibility problems\",\"authors\":\"L. Măruşter, Ş. Măruşter\",\"doi\":\"10.1109/ITI.2004.242702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions\",\"PeriodicalId\":320305,\"journal\":{\"name\":\"26th International Conference on Information Technology Interfaces, 2004.\",\"volume\":\"2004 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th International Conference on Information Technology Interfaces, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2004.242702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th International Conference on Information Technology Interfaces, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2004.242702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了已知仅弱收敛的凸可行性问题的一种投影方法。利用凸闭集族交点的一个性质,给出了使凸闭集族强收敛的一个条件,不需要附加的假设
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On convex feasibility problems
In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信