File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Solving polynomial systems: An LMI-based approach

TitleSolving polynomial systems: An LMI-based approach
Authors
KeywordsConvex optimization
LMI
Polynomial systems
Square matricial representation
Issue Date2006
Citation
Proceedings Of The Ieee Conference On Decision And Control, 2006, p. 5132-5137 How to Cite?
AbstractThis 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 Identifierhttp://hdl.handle.net/10722/99089
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChesi, Gen_HK
dc.contributor.authorHung, YSen_HK
dc.date.accessioned2010-09-25T18:15:23Z-
dc.date.available2010-09-25T18:15:23Z-
dc.date.issued2006en_HK
dc.identifier.citationProceedings Of The Ieee Conference On Decision And Control, 2006, p. 5132-5137en_HK
dc.identifier.issn0191-2216en_HK
dc.identifier.urihttp://hdl.handle.net/10722/99089-
dc.description.abstractThis 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.languageengen_HK
dc.relation.ispartofProceedings of the IEEE Conference on Decision and Controlen_HK
dc.subjectConvex optimizationen_HK
dc.subjectLMIen_HK
dc.subjectPolynomial systemsen_HK
dc.subjectSquare matricial representationen_HK
dc.titleSolving polynomial systems: An LMI-based approachen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChesi, G:chesi@eee.hku.hken_HK
dc.identifier.emailHung, YS:yshung@eee.hku.hken_HK
dc.identifier.authorityChesi, G=rp00100en_HK
dc.identifier.authorityHung, YS=rp00220en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-39649093394en_HK
dc.identifier.hkuros130740en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-39649093394&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage5132en_HK
dc.identifier.epage5137en_HK
dc.identifier.scopusauthoridChesi, G=7006328614en_HK
dc.identifier.scopusauthoridHung, YS=8091656200en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats