.png){kind=icon}
Return
A new penalty function algorithm for convex quadratic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(96)00138-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
quadratic programming
exterior point algorithm
exterior path
penalty methods
Newton's method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveBimodal counterpropagating-responsive sensing material for the detection of histamine.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAIShareSave
View more