Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization (Q4764307)
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: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization |
scientific article; zbMATH DE number 750701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization |
scientific article; zbMATH DE number 750701 |
Statements
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization (English)
0 references
4 May 1995
0 references
eigenvalue optimization
0 references
semidefinite programming
0 references
linear equality constraints
0 references
classical cone duality
0 references
interior point methods
0 references
maximum clique
0 references
maximum stable set
0 references
perfect graphs
0 references
0.8895071148872375
0 references
0.8731852173805237
0 references
