Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-020-01594-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-020-01594-Y / rank | |||
Normal rank | |||
Latest revision as of 05:51, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints |
scientific article |
Statements
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (English)
0 references
14 June 2022
0 references
polynomial optimization problems with nonnegative variables
0 references
doubly nonnegative relaxations
0 references
a class of polyhedral cones
0 references
the bisection and projection algorithm
0 references
computational efficiency and tight bounds
0 references
0 references
0 references
0 references
0 references
