A New Penalty Function Algorithm For Convex Quadratic Programming

A New Penalty Function Algorithm For Convex Quadratic Programming. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 101. pp. 155-163.

[img]
Preview
PDF (A New Penalty Function Algorithm For Convex Quadratic Programming)
a_new_penalty_function_algorithm_for_con_bendaya_isi_a1997yb87300014.pdf

Download (29kB) | Preview

Abstract

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. (C) 1997 Elsevier Science B.V.

Item Type: Article
Subjects: Systems
Divisions: College Of Computer Sciences and Engineering > Systems Engineering Dept
Depositing User: MR. ATIQ WALIULLAH SIDDIQUI
Date Deposited: 14 Jun 2008 16:18
Last Modified: 01 Nov 2019 16:44
URI: http://eprints.kfupm.edu.sa/id/eprint/2446