A dual-active-set algorithm for positive semi-definite quadratic programming |
| |
Authors: | N. L. Boland |
| |
Affiliation: | (1) Department of Mathematics, University of Melbourne, 3052 Parkville, VIC, Australia |
| |
Abstract: | Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming problems are valued. Goldfarb and Idnani (1983) describe one such method. Well known to be efficient and numerically stable, the Goldfarb and Idnani method suffers only from the restriction that in its original form it cannot be applied to problems which are positive semi-definite rather than positive definite. In this paper, we present a generalization of the Goldfarb and Idnani method to the positive semi-definite case and prove finite termination of the generalized algorithm. In our generalization, we preserve the spirit of the Goldfarb and Idnani method, and extend their numerically stable implementation in a natural way. Supported in part by ATERB, NSERC and the ARC. Much of this work was done in the Department of Mathematics at the University of Western Australia and in the Department of Combinatorics and Optimization at the University of Waterloo. |
| |
Keywords: | Quadratic programming Positive semi-definite Convex optimization Active-set method |
本文献已被 SpringerLink 等数据库收录! |
|