Algorithms for bound constrained quadratic programing problems
Technical Report
·
OSTI ID:6821362
We present an algorithm which combines standard active set strategies with the gradient projection method for the solution of quadratic programming problems subject to bounds. We show, in particular, that if the quadratic is bounded below on the feasible set then termination occurs at a stationary point in a finite number of iterations. Moreover, if all stationary points are nondegenerate, termination occurs at a local minimizer. A numerical comparison of the algorithm based on the gradient projection algorithm with a standard active set strategy shows that on mildly degenerate problems the gradient projection algorithm requires considerable less iterations typically decreases by at least a factor of 10. For strongly degenerate problems, the performance of the gradient projection algorithms deteriorates, but it still performs better than the active set method. 25 refs., 1 fig., 15 tabs.
- Research Organization:
- Argonne National Lab., IL (USA). Mathematics and Computer Science Div.
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6821362
- Report Number(s):
- ANL/MCS-TM-117; ON: DE88016470
- Country of Publication:
- United States
- Language:
- English
Similar Records
Projected gradient methods for linearly constrained problems
On the performance of algorithms for large-scale bound constrained problems
Numerical solution of bound constrained problems
Technical Report
·
Thu May 01 00:00:00 EDT 1986
·
OSTI ID:5424690
On the performance of algorithms for large-scale bound constrained problems
Conference
·
Wed Jan 31 23:00:00 EST 1990
·
OSTI ID:6937883
Numerical solution of bound constrained problems
Technical Report
·
Sat Aug 01 00:00:00 EDT 1987
·
OSTI ID:6118678