Nonlinearly constrained optimization via sequential regularized linear programming
This thesis proposes a new active-set method for large-scale nonlinearly con strained optimization. The method solves a sequence of linear programs to generate search directions. The typical approach for globalization is based on damping the search directions with a trust-region constraint; our prop...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2010
|
| Online Access: | http://hdl.handle.net/2429/29648 |