Optimization of multistage systems with nondifferentiable objective functions.
This dissertation is aimed at a class of convex dynamic optimization problems in which the transition functions are twice continuously differentiable and the stagewise objective functions are convex, although not necessarily differentiable. Two basic descent algorithms which use sequential and paral...
Main Author: | |
---|---|
Other Authors: | |
Language: | en |
Published: |
The University of Arizona.
1990
|
Subjects: | |
Online Access: | http://hdl.handle.net/10150/185050 |