Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: A Direct Active Set Algorithm for Large Sparse Quadratic Programs withSimple Bounds
Authors: Coleman, Thomas F.
Hulbert, Laurie
Keywords: computer science
technical report
Issue Date: Jul-1988
Publisher: Cornell University
Abstract: We show how a direct active set method for solving definite and indefinite quadratic programs with simple bounds can be efficiently implemented for large sparse problems. All of the necessary factorizations can be carried out in a static data structure that is set up before the numeric computation begins. The space required for these factorizations is no larger than that required for a single sparse Cholesky factorization of a matrix with the same sparsity structure as the Hessian of the quadratic. We propose several improvements to this basic algorithm: a new way to find a search direction in the indefinite case that allows us to free more than one variable at a time and a new heuristic method for finding a starting point. These ideas are motivated by the two-norm trust region problem. Additionally, we also show how projection techniques can be used to add several constraints to the active set at each iteration. Our experimental results show that an algorithm with these improvements runs much faster than the basic algorithm for positive definite problems and finds local minima with lower function values for indefinite problems.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
88-926.pdf3.37 MBAdobe PDFView/Open
88-926.ps767.15 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us