A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-007-9112-2 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064915245 / rank | |||
Revision as of 03:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones |
scientific article |
Statements
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (English)
0 references
13 February 2009
0 references
Polynomial optimization problem
0 references
Conic program
0 references
Symmetric cone
0 references
Euclidean Jordan algebra
0 references
Sum of squares
0 references
Global optimization
0 references
Semidefinite program
0 references
