Article ID: | iaor19992040 |
Country: | Netherlands |
Volume: | 101 |
Issue: | 1 |
Start Page Number: | 155 |
End Page Number: | 163 |
Publication Date: | Aug 1997 |
Journal: | European Journal of Operational Research |
Authors: | Ben-Daya M., Al-Sultan Khaled S. |
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an exterior path that we define. Convergence of the algorithm is established. The proposed algorithm was motivated by the work of Al-Sultan and Murty on nearest point problems, a special quadratic program. A preliminary implementation of the algorithm produced encouraging results. In particular, the algorithm requires a small and almost constant number of iterations to solve the small to medium size problems tested.