Fast Feasible Direction Methods, with Engineering Applications

dc.contributor.authorTits, A.L.en_US
dc.contributor.authorZhou, J.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:47:31Z
dc.date.available2007-05-23T09:47:31Z
dc.date.issued1991en_US
dc.description.abstractOptimization problems arising in engineering applications often present distinctive features that are not exploited, or not accounted for, in standard numerical optimization algorithms and software codes. First, in many cases, equality constraints are not present, or can be simply eliminated. Second, there are several instances where it is advantageous, or even crucial, that, once a feasible point has been achieved, all subsequent iterates be feasible as well. Third, many optimization problems arising engineering are best formulated as constrained minimax problems. Fourth, some specifications must be achieved over a range of values of an independent parameter (functional constraints).<P>While various other distinctive features arise in optimization problems found in specific classes of engineering problems, this paper focuses on those identified above, as they have been the object of special attention by the authors and their co-workers in recent years. Specifically, a basic scheme for efficiently tackling inequality constrained optimization while forcing feasible iterates is discussed and various extensions are proposed to handle the distinctive features just pointed out.en_US
dc.format.extent540730 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5069
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1991-20en_US
dc.subjectoptimizationen_US
dc.subjectcomputer aided designen_US
dc.subjectIntelligent Servomechanismsen_US
dc.titleFast Feasible Direction Methods, with Engineering Applicationsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_91-20.pdf
Size:
528.06 KB
Format:
Adobe Portable Document Format