Optimisation globale et théorie des moments (Q4763181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1565992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimisation globale et théorie des moments |
scientific article; zbMATH DE number 1565992 |
Statements
Optimisation globale et théorie des moments (English)
0 references
27 March 2001
0 references
constrained global minimum
0 references
real-valued polynomial map
0 references
compact semialgebraic set
0 references
convex positive semidefinite programs
0 references
0.9123346209526062
0 references
0.9119067192077636
0 references
0.847652792930603
0 references
0.8383223414421082
0 references
0.8333823680877686
0 references
The author considers the problem of finding the constrained global minimum of a real-valued polynomial map \(g_0: \mathbb{R}^n\to \mathbb{R}\) on a compact semialgebraic set \(k= \{x\in \mathbb{R}\mid g_1(x)\geq 0,\dots, g_m(x)\geq 0\}\) where \(g_1,\dots, g_m\) are real polynomials. Moreover, it is assumed that every polynomial \(p\), strictly positive on \(K\), has a respresentation \[ p(x)= q_0(x)+ \sum^m_{i=1} g_i(x) q_i(x), \] where the \(q_i\) are sums of squares of polynomials. The problem of finding the global minimum of \(g_0\) on \(K\) is reduced to solving an (often finite) sequence of convex positive semidefinite programs.
0 references