File Download
There are no files associated with this item.
Supplementary

Citations:
 Scopus: 0
 Appears in Collections:
Conference Paper: Solving polynomial systems: An LMIbased approach
Title  Solving polynomial systems: An LMIbased approach 

Authors  
Keywords  Convex optimization LMI Polynomial systems Square matricial representation 
Issue Date  2006 
Citation  Proceedings Of The Ieee Conference On Decision And Control, 2006, p. 51325137 How to Cite? 
Abstract  This paper considers the problem of computing the real solutions of systems of polynomial equalities and inequalities, and proposes a new approach based on convex linear matrix inequality (LMI) optimizations. In particular, the original polynomial systems is converted into an equivalent one whose number of solutions of the equality part that do not satisfy the inequalities (infeasible equality solutions) is reduced by introducing suitable auxiliary polynomials. Moreover, the solutions of this system can be computed by finding vectors with given polynomial structure in suitable linear spaces, operation that can be easily performed if the dimension of these linear spaces is not large. Examples show that the number of infeasible equality solutions can be drastically reduced, hence allowing for an easier and more accurate computation of the results. ©2006 IEEE. 
Persistent Identifier  http://hdl.handle.net/10722/99089 
ISSN  
References 
DC Field  Value  Language 

dc.contributor.author  Chesi, G  en_HK 
dc.contributor.author  Hung, YS  en_HK 
dc.date.accessioned  20100925T18:15:23Z   
dc.date.available  20100925T18:15:23Z   
dc.date.issued  2006  en_HK 
dc.identifier.citation  Proceedings Of The Ieee Conference On Decision And Control, 2006, p. 51325137  en_HK 
dc.identifier.issn  01912216  en_HK 
dc.identifier.uri  http://hdl.handle.net/10722/99089   
dc.description.abstract  This paper considers the problem of computing the real solutions of systems of polynomial equalities and inequalities, and proposes a new approach based on convex linear matrix inequality (LMI) optimizations. In particular, the original polynomial systems is converted into an equivalent one whose number of solutions of the equality part that do not satisfy the inequalities (infeasible equality solutions) is reduced by introducing suitable auxiliary polynomials. Moreover, the solutions of this system can be computed by finding vectors with given polynomial structure in suitable linear spaces, operation that can be easily performed if the dimension of these linear spaces is not large. Examples show that the number of infeasible equality solutions can be drastically reduced, hence allowing for an easier and more accurate computation of the results. ©2006 IEEE.  en_HK 
dc.language  eng  en_HK 
dc.relation.ispartof  Proceedings of the IEEE Conference on Decision and Control  en_HK 
dc.subject  Convex optimization  en_HK 
dc.subject  LMI  en_HK 
dc.subject  Polynomial systems  en_HK 
dc.subject  Square matricial representation  en_HK 
dc.title  Solving polynomial systems: An LMIbased approach  en_HK 
dc.type  Conference_Paper  en_HK 
dc.identifier.email  Chesi, G:chesi@eee.hku.hk  en_HK 
dc.identifier.email  Hung, YS:yshung@eee.hku.hk  en_HK 
dc.identifier.authority  Chesi, G=rp00100  en_HK 
dc.identifier.authority  Hung, YS=rp00220  en_HK 
dc.description.nature  link_to_subscribed_fulltext   
dc.identifier.scopus  eid_2s2.039649093394  en_HK 
dc.identifier.hkuros  130740  en_HK 
dc.relation.references  http://www.scopus.com/mlt/select.url?eid=2s2.039649093394&selection=ref&src=s&origin=recordpage  en_HK 
dc.identifier.spage  5132  en_HK 
dc.identifier.epage  5137  en_HK 
dc.identifier.scopusauthorid  Chesi, G=7006328614  en_HK 
dc.identifier.scopusauthorid  Hung, YS=8091656200  en_HK 