A unified analysis for a class of long-step primal-dual path-following interior-point algor.pdf

A unified analysis for a class of long-step primal-dual path-following interior-point algor.pdf

  1. 1、本文档共22页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A unified analysis for a class of long-step primal-dual path-following interior-point algor

A Uni ed Analysis for a Class of Long-StepPrimal-Dual Path-Following Interior-PointAlgorithms for Semide nite ProgrammingRenato D. C. Monteiro and Yin ZhangyJune 1996Revised May 1997AbstractWe present a uni ed analysis for a class of long-step primal-dual path-following algorithmsfor semide nite programming whose search directions are obtained through linearization ofthe symmetrized equation of the central path HP (XS)  [PXSP1 + (PXSP1)T ]=2 = I,introduced by Zhang. At an iterate (X;S), we choose a scaling matrix P from the class ofnonsingular matrices P such that PXSP1 is symmetric. This class of matrices includes thethree well-known choices, namely: P = S1=2 and P = X1=2 proposed by Monteiro, and thematrix P corresponding to the Nesterov-Todd direction. We show that within the class ofalgorithms studied in this paper, the one based on the Nesterov-Todd direction has the lowestpossible iteration-complexity bound that can provably be derived from our analysis. Morespeci cally, its iteration-complexity bound is of the same order as that of the correspondinglong-step primal-dual path-following algorithm for linear programming introduced by Kojima,Mizuno and Yoshise.Keywords: Semide nite programming, primal-dual, path-following, interior-point methods.Abbreviated Title: A class of primal-dual algorithms for SDPSchool of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332. This authorsresearch is supported in part by the National Science Foundation under grants INT-9600343 and CCR-970048 andthe Oce of Naval Research under grant N00014-94-1-0340.yDepartment of Computational and Applied Mathematics, Rice University, Houston, Texas 77005-1892. Thisauthors research is supported in part by DOE DE-FG02-93ER25171-A001.1 1 IntroductionSeveral authors have discussed generalizations of interior-point algorithms for linear programming(LP) to the context of semide nite programming (SDP). The landmark work in this direction is dueto Nester

您可能关注的文档

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档