Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048)
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: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term |
scientific article; zbMATH DE number 6117462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term |
scientific article; zbMATH DE number 6117462 |
Statements
Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (English)
0 references
20 December 2012
0 references
The author analyzes large and small-update methods of a primal-dual interior-point algorithm based on a new kernel function with trigonometric barrier term for solving standard semidefinite optimization problems. The default step size of the algorithm is determined, and an upper bound to the decrease of the barrier function during an inner iteration is obtained. The iteration bounds for large and small-update method are established.
0 references
kernel function
0 references
interior-point algorithm
0 references
semidefinite optimization
0 references
polynomial complexity
0 references
primal-dual method
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.920206904411316
0 references
0.9152110815048218
0 references
0.9129852056503296
0 references
0.8918759822845459
0 references
