Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-022-05103-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4310092690 / rank | |||
Normal rank | |||
Revision as of 23:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems |
scientific article |
Statements
Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (English)
0 references
23 January 2023
0 references
convex polynomial
0 references
robust optimization
0 references
optimality conditions
0 references
SDP relaxations
0 references
convergence
0 references
