File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Unified gradient approach to performance optimization under a pole assignment constraint

TitleUnified gradient approach to performance optimization under a pole assignment constraint
Authors
KeywordsDisturbance Rejection
Gradient Method
Performance Optimization
Pole Assignment
Issue Date2004
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0022-3239
Citation
Journal Of Optimization Theory And Applications, 2004, v. 121 n. 2, p. 361-383 How to Cite?
AbstractGeneral closed-loop performance optimization problems with pole assignment constraint are considered in this paper under a unified framework. By introducing a free-parameter matrix and a matrix function based on the solution of a Sylvester equation, the constrained optimization problem is transformed into an unconstrained one, thus reducing the problem of closed-loop performance optimization with pole placement constraint to the computation of the gradient of the performance index with respect to the free-parameter matrix. Several classical performance indices are then optimized under the pole placement constraint. The effectiveness of the proposed gradient method is illustrated with an example.
Persistent Identifierhttp://hdl.handle.net/10722/156958
ISSN
2014 Impact Factor: 1.509
2014 SCImago Journal Rankings: 1.147
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHu, TSen_US
dc.contributor.authorLin, ZLen_US
dc.contributor.authorLam, Jen_US
dc.date.accessioned2012-08-08T08:44:43Z-
dc.date.available2012-08-08T08:44:43Z-
dc.date.issued2004en_US
dc.identifier.citationJournal Of Optimization Theory And Applications, 2004, v. 121 n. 2, p. 361-383en_US
dc.identifier.issn0022-3239en_US
dc.identifier.urihttp://hdl.handle.net/10722/156958-
dc.description.abstractGeneral closed-loop performance optimization problems with pole assignment constraint are considered in this paper under a unified framework. By introducing a free-parameter matrix and a matrix function based on the solution of a Sylvester equation, the constrained optimization problem is transformed into an unconstrained one, thus reducing the problem of closed-loop performance optimization with pole placement constraint to the computation of the gradient of the performance index with respect to the free-parameter matrix. Several classical performance indices are then optimized under the pole placement constraint. The effectiveness of the proposed gradient method is illustrated with an example.en_US
dc.languageengen_US
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0022-3239en_US
dc.relation.ispartofJournal of Optimization Theory and Applicationsen_US
dc.subjectDisturbance Rejectionen_US
dc.subjectGradient Methoden_US
dc.subjectPerformance Optimizationen_US
dc.subjectPole Assignmenten_US
dc.titleUnified gradient approach to performance optimization under a pole assignment constrainten_US
dc.typeArticleen_US
dc.identifier.emailLam, J:james.lam@hku.hken_US
dc.identifier.authorityLam, J=rp00133en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1023/B:JOTA.0000037409.86566.f9en_US
dc.identifier.scopuseid_2-s2.0-4344612745en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4344612745&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume121en_US
dc.identifier.issue2en_US
dc.identifier.spage361en_US
dc.identifier.epage383en_US
dc.identifier.isiWOS:000223205700006-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridHu, TS=7202704587en_US
dc.identifier.scopusauthoridLin, ZL=7404229141en_US
dc.identifier.scopusauthoridLam, J=7201973414en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats