Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
12. Polynomial Optimization
verfasst von : Hoang Tuy
Erschienen in: Convex Analysis and Global Optimization
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Polynomial optimization is concerned with optimization problems described by multivariate polynomials on \(\mathbb{R}_{+}^{n}.\) In this chapter two approaches are presented for polynomial optimization. In the first approach a polynomial optimization problem is solved as a nonconvex optimization problem by a rectangular branch and bound algorithm in which bounding is performed by linear or convex relaxation. In the second approach, by viewing any multivariate polynomial on \(\mathbb{R}_{+}^{n}\) as a difference of two increasing functions, a polynomial optimization problem is treated as a monotonic optimization problem. In particular, the Successive Incumbent Transcending algorithm is developed which starts from a quickly found feasible solution then proceeds to gradually improving it to optimality.