A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559)
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 polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization |
scientific article; zbMATH DE number 7388737
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization |
scientific article; zbMATH DE number 7388737 |
Statements
A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (English)
0 references
31 August 2021
0 references
semidefinite optimization
0 references
infeasible interior-point method
0 references
arc-search strategy
0 references
wide neighborhood
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
