Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2017.12.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2017.12.015 / rank | |||
Normal rank | |||
Latest revision as of 21:21, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy |
scientific article |
Statements
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (English)
0 references
20 February 2020
0 references
polynomial optimization
0 references
sparse sum-of-squares hierarchy
0 references
semi-definite programming
0 references
pooling problem
0 references
chordal sparsity structure
0 references
discrete-time optimal control
0 references
0 references
0 references
0 references
0 references
0 references
