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.