Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128850668, #quickstatements; #temporary_batch_1729546961733 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/17m1152061 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2903064578 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128850668 / rank | |||
Normal rank | |||
Latest revision as of 22:52, 21 October 2024
scientific article; zbMATH DE number 6989164
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizer Extraction in Polynomial Optimization Is Robust |
scientific article; zbMATH DE number 6989164 |
Statements
Minimizer Extraction in Polynomial Optimization Is Robust (English)
0 references
5 December 2018
0 references
polynomial optimization
0 references
sum of squares
0 references
semidefinite programming
0 references
moment problem
0 references
Hankel matrix
0 references
flat extension
0 references
GNS construction
0 references
noncommutative polynomial
0 references
trace
0 references
0 references
0 references
0 references
0 references
0 references
