魏紫銮 副研究员In the paper we classi fy most of the methods for solving quadratic programs into two main categories. One is called tableau format method, the other is called active set method. Since the iterational points in both of them always move along the edges of the feasible region, the convergent rate of the methods may slow for large-scale problems. This paper attempts to solve the QP p roblem using an interior point method. The global convergence of the met hod is proved under the assumptions