Abstract: This paper presents a new primal?dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial.

• 文摘:本文为框式约束的一类凸规划提出了一个新的内点算法，原始-对偶路径跟踪法，并证明了算法的迭代复杂性为多项式时间性.