Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems (Q4946709)
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: Publication:4946709 |
scientific article; zbMATH DE number 1422765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems |
scientific article; zbMATH DE number 1422765 |
Statements
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems (English)
0 references
20 August 2000
0 references
semidefinite programming
0 references
interior-point methods
0 references
primal-dual algorithms
0 references
polynomial complexity
0 references
0.8766297698020935
0 references
0.8766297698020935
0 references
0.8420993685722351
0 references
