An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
We propose a modification of our MPGP algorithm for the solution of bound constrained quadratic programming problems so that it can be used for minimization of a strictly convex quadratic function subject to separable convex constraints. Our active set based algorithm explores the faces by conjugate...
Saved in:
| Published in: | Mathematical programming Vol. 135; no. 1-2; pp. 195 - 220 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer-Verlag
01.10.2012
Springer Springer Nature B.V |
| Subjects: | |
| ISSN: | 0025-5610, 1436-4646 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!