Show simple item record

dc.contributor.advisorSen, Suvrajeeten_US
dc.contributor.authorDunatunga, Manimelwadu Samson.
dc.creatorDunatunga, Manimelwadu Samson.en_US
dc.date.accessioned2011-10-31T17:26:13Z
dc.date.available2011-10-31T17:26:13Z
dc.date.issued1990en_US
dc.identifier.urihttp://hdl.handle.net/10150/185050
dc.description.abstractThis 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 parallel coordinating techniques are developed. In both algorithms the nondifferentiability of the objective function is accounted for by using subgradient information. The objective of the subproblems generated consists of successive piecewise linear approximations of the stagewise objective function and the value function. In the parallel algorithm, an incentive coordination method is used to coordinate the subproblems. We provide proofs of convergence for these algorithms. Two variations, namely, subgradient selection and subgradient aggregation, of the basic algorithms are also discussed. In practice while subgradient selection seems to perform well, computational results with subgradient aggregation are rather disappointing. Computational results of the basic algorithms and variants based on subgradient selection are given. The effect of number of stages on performance of these algorithms is compared with a general nonlinear programming package (NPSOL).
dc.language.isoenen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectEngineeringen_US
dc.titleOptimization of multistage systems with nondifferentiable objective functions.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.identifier.oclc710855353en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.contributor.committeememberGoldberg, Geffreyen_US
dc.contributor.committeememberHigle, Juliaen_US
dc.identifier.proquest9025069en_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.namePh.D.en_US
refterms.dateFOA2018-06-12T11:05:42Z
html.description.abstractThis 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 parallel coordinating techniques are developed. In both algorithms the nondifferentiability of the objective function is accounted for by using subgradient information. The objective of the subproblems generated consists of successive piecewise linear approximations of the stagewise objective function and the value function. In the parallel algorithm, an incentive coordination method is used to coordinate the subproblems. We provide proofs of convergence for these algorithms. Two variations, namely, subgradient selection and subgradient aggregation, of the basic algorithms are also discussed. In practice while subgradient selection seems to perform well, computational results with subgradient aggregation are rather disappointing. Computational results of the basic algorithms and variants based on subgradient selection are given. The effect of number of stages on performance of these algorithms is compared with a general nonlinear programming package (NPSOL).


Files in this item

Thumbnail
Name:
azu_td_9025069_sip1_m.pdf
Size:
2.433Mb
Format:
PDF
Description:
azu_td_9025069_sip1_m.pdf

This item appears in the following Collection(s)

Show simple item record