Decomposition methods for nonlinear nonconvex optimization problems
The subject of this thesis is the development of ways to solve structured nonlinear nonconvex programming problems by a decomposition procedure. This thesis extends the existing decomposition methods for linear or convex problems to the nonconvex nonlinear case. The algorithms presented are in princ...
| Main Author: | |
|---|---|
| Published: |
University of Edinburgh
2001
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.651845 |