File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.automatica.2014.12.007
- Scopus: eid_2-s2.0-84922439972
- WOS: WOS:000350780100034
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Minimizing trigonometric matrix polynomials over semi-algebraic sets
Title | Minimizing trigonometric matrix polynomials over semi-algebraic sets |
---|---|
Authors | |
Keywords | Frequency methods Order reduction SDP Trigonometric matrix polynomials |
Issue Date | 2015 |
Publisher | Elsevier. The Journal's web site is located at http://www.elsevier.com/locate/automatica |
Citation | Automatica, 2015, v. 52, p. 266-271 How to Cite? |
Abstract | This paper addresses the problem of minimizing the minimum eigenvalue of a trigonometric matrix polynomial. The contribution is to show that, by exploiting Putinar's Positivstellensatz and introducing suitable transformations, it is possible to derive a nonconservative approach based on semidefinite programming (SDP) whose computational burden can be significantly smaller than that of an existing method recently published. Other advantages of the proposed approach include the possibility of taking into account the presence of constraints in the form of semi-algebraic sets and establishing tightness of a found lower bound. © 2014 Elsevier. Ltd All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/211753 |
ISSN | 2023 Impact Factor: 4.8 2023 SCImago Journal Rankings: 3.502 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chesi, G | - |
dc.date.accessioned | 2015-07-21T02:09:59Z | - |
dc.date.available | 2015-07-21T02:09:59Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Automatica, 2015, v. 52, p. 266-271 | - |
dc.identifier.issn | 0005-1098 | - |
dc.identifier.uri | http://hdl.handle.net/10722/211753 | - |
dc.description.abstract | This paper addresses the problem of minimizing the minimum eigenvalue of a trigonometric matrix polynomial. The contribution is to show that, by exploiting Putinar's Positivstellensatz and introducing suitable transformations, it is possible to derive a nonconservative approach based on semidefinite programming (SDP) whose computational burden can be significantly smaller than that of an existing method recently published. Other advantages of the proposed approach include the possibility of taking into account the presence of constraints in the form of semi-algebraic sets and establishing tightness of a found lower bound. © 2014 Elsevier. Ltd All rights reserved. | - |
dc.language | eng | - |
dc.publisher | Elsevier. The Journal's web site is located at http://www.elsevier.com/locate/automatica | - |
dc.relation.ispartof | Automatica | - |
dc.rights | © 2015. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Frequency methods | - |
dc.subject | Order reduction | - |
dc.subject | SDP | - |
dc.subject | Trigonometric matrix polynomials | - |
dc.title | Minimizing trigonometric matrix polynomials over semi-algebraic sets | - |
dc.type | Article | - |
dc.identifier.email | Chesi, G: chesi@eee.hku.hk | - |
dc.identifier.authority | Chesi, G=rp00100 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1016/j.automatica.2014.12.007 | - |
dc.identifier.scopus | eid_2-s2.0-84922439972 | - |
dc.identifier.hkuros | 245056 | - |
dc.identifier.volume | 52 | - |
dc.identifier.spage | 266 | - |
dc.identifier.epage | 271 | - |
dc.identifier.isi | WOS:000350780100034 | - |
dc.publisher.place | United Kingdom | - |
dc.identifier.issnl | 0005-1098 | - |