Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (Q1812072)
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: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming |
scientific article; zbMATH DE number 1930226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming |
scientific article; zbMATH DE number 1930226 |
Statements
Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming (English)
0 references
18 June 2003
0 references
Approximation algorithms
0 references
Stability number
0 references
Semidefinite programming
0 references
Copositive cone
0 references
Standard quadratic optimization
0 references
Linear matrix inequalities
0 references
0.8723081946372986
0 references
0.8527883887290955
0 references
0.8503752946853638
0 references
0.8449382185935974
0 references
