An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function (Q4593509)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6811287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function |
scientific article; zbMATH DE number 6811287 |
Statements
22 November 2017
0 references
convex quadratic semidefinite optimization problem
0 references
primal-dual interior-point methods
0 references
kernel function
0 references
iteration complexity
0 references
An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function (English)
0 references
0.9468816
0 references
0.9449623
0 references
0.9427017
0 references
0 references
0.93135464
0 references
0.93098277
0 references
0.9269198
0 references
0.92686397
0 references
