Getting a perfectly centered initial point for feasible path-following interior-point algorithms is a hard practical task. Therefore, it is worth to analyze other cases when the starting point is not necessarily centered. In this paper, we propose a short-step weighted-path following interior-point algorithm (IPA) for solving convex quadratic optimization (CQO). The latter is based on a modified search direction which is obtained by the technique of algebraically equivalent transformation (AET) introduced by a new univariate function to the Newton system which defines the weighted-path. At each iteration, the algorithm uses only full-Newton steps and the strategy of the central-path for tracing approximately the weighted-path. We show that the algorithm is well-defined and converges locally quadratically to an optimal solution of CQO. Moreover, we obtain the currently best known iteration bound, namely, $\mathcal{O}\left(\sqrt{n}\log \dfrac{n}{\epsilon}\right)$ which is as good as the bound for linear optimization analogue. Some numerical results are given to evaluate the efffficiency of the algorithm.