Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints |
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
