Thumbnail Image
Item

The approach of moments for polynomial equations

Laurent,M.
; 
Rostalski,P.
Abstract
In this chapter we present the moment based approach for computing all real solutions of a given system of polynomial equations. This approach builds upon a lifting method for constructing semidefinite relaxations of several nonconvex optimization problems, using sums of squares of polynomials and the dual theory of moments. A crucial ingredient is a semidefinite characterization of the real radical ideal, consisting of all polynomials with the same real zero set as the system of polynomials to be solved. Combining this characterization with ideas from commutative algebra, (numerical) linear algebra and semidefinite optimization yields a new class of real algebraic algorithms. This chapter sheds some light on the underlying theory and the link to polynomial optimization.
Description
Pagination: 957
Date
2012
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
Handbook_of_SDP-final.pdf
Adobe PDF, 462.33 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Laurent, M & Rostalski, P 2012, The approach of moments for polynomial equations. in M F Anjos & J B Lasserre (eds), Handbook on Semidefinite, Cone and Polynomial Optimization. International Series in Operations Research & Management Science, no. 166, Elsevier, Amsterdam, pp. 25-60. < http://www.springerlink.com/content/p475x9g43w231x44/ >
URI
https://hdl.handle.net/20.500.14602/15908
License
info:eu-repo/semantics/restrictedAccess
Embedded videos