Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces英文文献资料.docVIP

下载本文档

8
0
约 40页
2017-05-10 发布于上海
举报
版权申诉

Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces英文文献资料.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces英文文献资料

BREGMANDISTANCES,TOTALLYCONVEXFUNCTIONS, ANDAMETHODFORSOLVINGOPERATOREQUATIONS INBANACHSPACES DANBUTNARIUANDELENARESMERITA Received25July2004;Accepted6April2005 Theaimofthispaperistwofold.First,severalbasicmathematicalconceptsinvolvedinthe constructionandstudyofBregmantypeiterativealgorithmsarepresentedfromauni?ed analyticperspective.Also,somegapsinthecurrentknowledgeaboutthoseconceptsare ?lled in. Second, weemploy existing results on total convexity,sequential consistency, uniformconvexityandrelativeprojectionsinordertode?neandstudytheconvergence ofanewBregmantypeiterativemethodofsolvingoperatorequations. Copyright?2006D.ButnariuandE.Resmerita.Thisisanopenaccessarticledistributed undertheCreativeCommons Attribution License,whichpermits unrestricted use,dis- tribution,andreproductioninanymedium,providedtheoriginalworkisproperlycited. 1.Introduction LetX beaBanach space and f :X →(?∞,+∞]beaproper convexfunction. Forany x∈domf andz∈Xwedenoteby f x z ? ( , )theright-hand sidederivativeof f at x inthe directionz,thatis, f?(x,z)=limt0 f(x+tz)?f(x). (1.1) t ThefunctionDf :domf ×domf →[0,+∞]givenby Df(y,x):= f(y)?f(x)?f?(x,y?x) (1.2) iscalledtheBregman distancewithrespectto f.LevBregman[20]hasdiscoveredanel- egantande?ectivetechniquefortheuseofthefunction Df intheprocessofdesigning andanalyzingfeasibilityandoptimizationalgorithms.Thisopenedagrowingareaofre- searchinwhichBregman’stechnique isapplied invarious waysinordertodesign and analyze iterativealgorithms forsolving notonlyfeasibility andoptimization problems, butalsoalgorithmsforsolvingvariationalinequalities,forapproximatingequilibria,for computing?xedpointsofnonlinearmappingsandmore(see[3,6,12,16,20,23,24,26– 29,33,36,40,48,49,51,60,65],andthereferencestherein).Althoughcalleda“distance” HindawiPublishingCorporation AbstractandAppliedAnalysis Volume2006,ArticleID84919,Pages1–39 DOI10.1155/AAA/2006/84919 2 Bregmandistances,totalconvexity,operatorequations byCensorandLent[35],thefunctionD