A second derivative SQP method: Theoretical issues
Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particul...
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
Oxford University Computing Laboratory
2008
|