This paper discusses a path-following infeasible-interior-point algorithm to solve convex quadratic programming problems. An experimental code has also been developed and some numerical results have been obtained by using the algorithm to solve several convex quadratic programming problems (COP).
Cite this article:
Gupta and Chaudhari (1998). A Path-Following Infeasible-Interior-Point Algorithm to Solve Convex Quadratic Programming Problems. Journal of Ravishankar University (Part-B: Science), 11(1), pp.17-23.