A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function (Q5209519)
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: A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function |
scientific article; zbMATH DE number 7155985
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function |
scientific article; zbMATH DE number 7155985 |
Statements
22 January 2020
0 references
semidefinite programming
0 references
infeasible interior-point methods
0 references
full Nesterov-Todd steps
0 references
kernel functions
0 references
polynomial complexity
0 references
A Modified Full-NT-Step Infeasible Interior-Point Algorithm for SDP Based on a Specific Kernel Function (English)
0 references
0.94853276014328
0 references
0.9312326312065125
0 references
0.8874273896217346
0 references
0.8741671442985535
0 references
