Abstract
GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality (LMI) relaxations of non-convex optimization problems with multivariate polynomial objective function and constraints, based on the theory of moments. In contrast with the dual sum-of-squares decompositions of positive polynomials, the theory of moments allows to detect global optimality of an LMI relaxation and extract globally optimal solutions. In this report, we describe and illustrate the numerical linear algebra algorithm implemented in GloptiPoly for detecting global optimality and extracting solutions. We also mention some related heuristics that could be useful to reduce the number of variables in the LMI relaxations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Henrion, D., Lasserre, JB. Detecting Global Optimality and Extracting Solutions in GloptiPoly. In: Henrion, D., Garulli, A. (eds) Positive Polynomials in Control. Lecture Notes in Control and Information Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10997703_15
Download citation
DOI: https://doi.org/10.1007/10997703_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23948-2
Online ISBN: 978-3-540-31594-0
eBook Packages: EngineeringEngineering (R0)