中文摘要：

对凸二次半定规划提出了一种新的全-Newton步原始-对偶内点算法.通过建立和应用一些新的技术性结果,证明了算法的迭代复杂性为O（√nlogn/ε）,这与目前凸二次半定规划的小步校正内点算法最好的迭代复杂性一致.

英文摘要：

In this paper, we propose a new full-Newton step primal-dual interior-point algorithm for solving convex quadratic semi-definite programming. By establishing and using new technical results, we show that theiteration complexity of algorithm as O（√nlogn/ε）is as good as the currently best iteration complexity forsmall-update interior-point algorithms of convex quadratic semi-definite programming.