Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331)
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 infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function |
scientific article; zbMATH DE number 7040054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function |
scientific article; zbMATH DE number 7040054 |
Statements
Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (English)
0 references
21 March 2019
0 references
semidefinite optimization
0 references
infeasible interior-point method
0 references
trigonometric kernel function
0 references
full Nesterov-Todd step
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90268737077713
0 references
0.9001944661140442
0 references
0.8729534149169922
0 references
0.8661126494407654
0 references
