Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239)
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: Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization |
scientific article; zbMATH DE number 5584627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization |
scientific article; zbMATH DE number 5584627 |
Statements
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (English)
0 references
22 July 2009
0 references
interior-point algorithm
0 references
primal-dual method
0 references
semidefinite optimization
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.95571524
0 references
0.95206594
0 references
0.94560665
0 references
0.9442961
0 references
0.93751544
0 references
0 references
0.93013716
0 references
0.9285378
0 references
0 references
