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.
Joumai
ol Ravishankar University Vol.11-12 No.
B (Science) 1998·99, pp.17·23 ISSN
0970-5910
A Path-Following Infeasible-Interior-Point
Algorithm to Solve Convex Quadratic
Programming Problems
Smita Gupta and N.S. Chaudhari
School of Computer
Science, Devi Ahilya University, Indore - 452 001
Ms Received: 19. 11.96, Revised: 19.9.97, Accepted: 19.10.97
Abstract: 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).
NOTE: Full version
of this manuscript is available in PDF.