Mostafa Khorramizadeh - Department of Mathematical Sciences Shiraz University of Technology Shiraz 71555-313, Iran.
In this paper, we present numerical results concerning a comparison between the normal equation approach and an ABS approach for computing the search direction of primal-dual infeasible interior point methods for solving convex quadratic programming problems (CQPs). Let \(m\) and \(n\) denote the number of constraints and the number of variables, respectively. The numerical results show that, when \(\frac{m}{n}\) is small, then the ABS approach needs a considerably less computing time. When \(\frac{m}{n}\) is close to one, then the normal equations approach is more efficient than the ABS approach.
Mostafa Khorramizadeh, Comparison of Normal Equation with an Abs Approach for Solving Convex Quadratic Programs, Journal of Mathematics and Computer Science, 13 (2014), no. 3, 226-230
Khorramizadeh Mostafa, Comparison of Normal Equation with an Abs Approach for Solving Convex Quadratic Programs. J Math Comput SCI-JM. (2014); 13(3):226-230
Khorramizadeh, Mostafa. "Comparison of Normal Equation with an Abs Approach for Solving Convex Quadratic Programs." Journal of Mathematics and Computer Science, 13, no. 3 (2014): 226-230