首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH
作者姓名:杨晓光
作者单位:Institute of Systems Science. the Chinese Academy of Sciences,Beijing 100080,China
摘    要:1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM2](Expextation--Maximization)algoritllnlforPositronemissiontonlography']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem5]establishedanelegantconv…

收稿时间:2 December 1993

On the convergence of multiplicative iterative algorithms with inexact line search
Xiaoguang Yang.ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH[J].Acta Mathematicae Applicatae Sinica,1997,13(4):337-341.
Authors:Xiaoguang Yang
Institution:(1) Institute of Systems Science, the Chinese Academy of Sciences, 100080 Beijing, China
Abstract:This paper studies thee convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rille, under the assumption of convexity of objective function or the assumption of convergence of the sequence generated by the algorithm. This answers an open problem put forward by lusem.
Keywords:Multipl  icative iterative algorithm  inexact line search  convergence
本文献已被 CNKI SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号