A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity (Q2895762)
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 full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity |
scientific article; zbMATH DE number 6052755
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity |
scientific article; zbMATH DE number 6052755 |
Statements
4 July 2012
0 references
semidefinite optimization
0 references
infeasible interior-point method
0 references
polynomial complexity
0 references
self-regular
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity (English)
0 references
