期刊文献+

一类二次半定规划内点算法的搜索方向 被引量:5

Search Directions of Inexact Primal-dual Path- Following Algorithms for A Special Class of Quadratic SDP
原文传递
导出
摘要 利用牛顿法求解一类二次半定规划的扰动KKT方程组,得出这类二次半定规划原始-对偶路径跟踪算法搜索方向求解的统一形式,以及HKM搜索方向和NT搜索方向存在唯一的充分条件,最后给出了计算搜索方向的表达式,和特殊情况下搜索方向的计算方法. By using Newton method,the perturbed KKT conditions associated with a special class of quadratic SDP are computed,and the unified form of equation solving search directions is obtained;Under the unified form,A sufficient conditions about the existence and uniqueness of the HKM search direction and the NT search direction are presented,then we give the expression of search direction and how to compute search direction concretely for some special classes.
出处 《数学的实践与认识》 CSCD 北大核心 2010年第20期217-223,共7页 Mathematics in Practice and Theory
基金 辽宁省教育厅基金(2009A3467) 辽宁工程技术大学研究生资助(Y200901002)
关键词 二次半定规划 内点算法 搜索方向 牛顿法 quadratic semi-definite programming interior point algorithm search direction Newton method
  • 相关文献

参考文献3

二级参考文献13

  • 1徐凤敏,徐成贤.求解二次半定规划的原对偶内点算法(英文)[J].工程数学学报,2006,23(4):590-598. 被引量:4
  • 2Alizadeh F, Haeberly J P, Overton M. Primal Dual Interior Point Methods for Semidefinite Programming[M]. Technical Report 659, Cumputer Science, New York University, New York, NY,1994.
  • 3Kojima M, Shindoh S, Hara S. Interior point methods for the monotone semidefinite complementarity promble in symmtric matriees[J]. SIAM J Optim,1997,7:86-125.
  • 4Helmberg C, Rendl F, Vanderbei R J, Wolkowicz H. An interior point method for semidefinite programming[J]. SIAM J Optim,1996,6:342-361.
  • 5Monteiro R D C. Primal dual path following algorithms for semidefinite programming[J]. SIAM J Optim, 1997,7: 663-678.
  • 6Nesterov Y E, Todd M. Primal dual interior point methods for self-scaled cones [J]. SIAM J Optim, 1998,8 : 324- 364.
  • 7Nesterov Y E, Todd M. Self-scaled barriers and interior point methods for convex programming[J]. Math Oper Res,1997,22:1-42.
  • 8Todd M J, Toh K C, Tutuncu R H. On the nesterov-todd direction in SDP[J]. SIAM J Optimization,1998,8(3) : 769-796.
  • 9Nesterov Y, Nemirovskii A S. Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms[M]. SIAM Philadelphia PA,1994.
  • 10ZHANG Y. On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming[J]. SIAM J Optim,1998,8:365-386.

共引文献6

同被引文献54

引证文献5

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部