Abstract: Inspired by Darvay's work that developed a weighted path-following interior point algorithm for solving Linear Programming, we extend in this paper the algorithm of Darvay to solve convex quadratic optimization problem and show that this algorithm has local quadratic convergence rate and the favorable polynomial complexity bound.