File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Approximation of discrete-time systems with time-varying delay: Hankel norm criterion

TitleApproximation of discrete-time systems with time-varying delay: Hankel norm criterion
Authors
KeywordsDiscrete-Time Systems
Hankel Norm
Linear Matrix Inequality
Model Reduction
Time-Varying Delay
Issue Date2004
Citation
Proceedings Of The Sice Annual Conference, 2004, p. 1035-1040 How to Cite?
AbstractThe problem of Hankel norm model reduction for discrete-time systems with time-varying state delay is investigated. For a given stable system, this paper focuses on constructing stable reduced-order models under the Hankel norm error criterion. Two different approaches are proposed to solve this problem. One is based on the cone complementarity linearization idea, which casts the model reduction into a sequential minimization problem subject to linear matrix inequality constraints, and the other casts the model reduction into a convex optimization problem by using a linearization procedure. A numerical example is provided to show the effectiveness of the proposed theories.
Persistent Identifierhttp://hdl.handle.net/10722/158944
References

 

DC FieldValueLanguage
dc.contributor.authorGao, Hen_US
dc.contributor.authorLam, Jen_US
dc.contributor.authorWang, Cen_US
dc.date.accessioned2012-08-08T09:04:42Z-
dc.date.available2012-08-08T09:04:42Z-
dc.date.issued2004en_US
dc.identifier.citationProceedings Of The Sice Annual Conference, 2004, p. 1035-1040en_US
dc.identifier.urihttp://hdl.handle.net/10722/158944-
dc.description.abstractThe problem of Hankel norm model reduction for discrete-time systems with time-varying state delay is investigated. For a given stable system, this paper focuses on constructing stable reduced-order models under the Hankel norm error criterion. Two different approaches are proposed to solve this problem. One is based on the cone complementarity linearization idea, which casts the model reduction into a sequential minimization problem subject to linear matrix inequality constraints, and the other casts the model reduction into a convex optimization problem by using a linearization procedure. A numerical example is provided to show the effectiveness of the proposed theories.en_US
dc.languageengen_US
dc.relation.ispartofProceedings of the SICE Annual Conferenceen_US
dc.subjectDiscrete-Time Systemsen_US
dc.subjectHankel Normen_US
dc.subjectLinear Matrix Inequalityen_US
dc.subjectModel Reductionen_US
dc.subjectTime-Varying Delayen_US
dc.titleApproximation of discrete-time systems with time-varying delay: Hankel norm criterionen_US
dc.typeConference_Paperen_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.scopuseid_2-s2.0-12744281005en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-12744281005&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage1035en_US
dc.identifier.epage1040en_US
dc.identifier.scopusauthoridGao, H=7402971422en_US
dc.identifier.scopusauthoridLam, J=7201973414en_US
dc.identifier.scopusauthoridWang, C=8337851300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats