Abstract
Stable techniques are considered for updating the reduced Hessian matrix that arises in a null-space active set method for quadratic programming when the Hessian matrix itself may be indefinite. A scheme for defining and updating the null-space basis matrix is described which is adequately stable and allows advantage to be taken of sparsity in the constraint matrix. A new canonical form for the reduced Hessian matrix is proposed that can be updated in a numerically stable way. Some consequences for the choice of minor iteration search direction are described.
| Original language | English |
|---|---|
| Pages (from-to) | 251-264 |
| Number of pages | 14 |
| Journal | Mathematical Programming |
| Volume | 87 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Apr 2000 |
Fingerprint
Dive into the research topics of 'Stable reduced Hessian updates for indefinite quadratic programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver