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

File Download
  • No File Attached
Links for fulltext
(May Require Subscription)
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleUnified gradient approach to performance optimization under a pole assignment constraint
AuthorsHu, TS1
Lin, ZL1
Lam, J2
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
CitationJournal Of Optimization Theory And Applications, 2004, v. 121 n. 2, p. 361-383 [How to Cite?]
DOI: http://dx.doi.org/10.1023/B:JOTA.0000037409.86566.f9
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.
ISSN0022-3239
2011 Impact Factor: 1.062
2011 SCImago Journal Rankings: 0.053
DOIhttp://dx.doi.org/10.1023/B:JOTA.0000037409.86566.f9
ISI Accession Number IDWOS:000223205700006
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorHu, TS
dc.contributor.authorLin, ZL
dc.contributor.authorLam, J
dc.date.accessioned2012-08-08T08:44:43Z
dc.date.available2012-08-08T08:44:43Z
dc.date.issued2004
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.
dc.description.natureLink_to_subscribed_fulltext
dc.identifier.citationJournal Of Optimization Theory And Applications, 2004, v. 121 n. 2, p. 361-383 [How to Cite?]
DOI: http://dx.doi.org/10.1023/B:JOTA.0000037409.86566.f9
dc.identifier.doihttp://dx.doi.org/10.1023/B:JOTA.0000037409.86566.f9
dc.identifier.epage383
dc.identifier.isiWOS:000223205700006
dc.identifier.issn0022-3239
2011 Impact Factor: 1.062
2011 SCImago Journal Rankings: 0.053
dc.identifier.issue2
dc.identifier.scopuseid_2-s2.0-4344612745
dc.identifier.spage361
dc.identifier.urihttp://hdl.handle.net/10722/156958
dc.identifier.volume121
dc.languageeng
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0022-3239
dc.publisher.placeUnited States
dc.relation.ispartofJournal of Optimization Theory and Applications
dc.relation.referencesReferences in Scopus
dc.subjectDisturbance Rejection
dc.subjectGradient Method
dc.subjectPerformance Optimization
dc.subjectPole Assignment
dc.titleUnified gradient approach to performance optimization under a pole assignment constraint
dc.typeArticle
Author Affiliations
  1. University of Virginia
  2. The University of Hong Kong