Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood (Q3514846)
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: Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood |
scientific article; zbMATH DE number 5303510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood |
scientific article; zbMATH DE number 5303510 |
Statements
Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood (English)
0 references
23 July 2008
0 references
interior-point method
0 references
path-following algorithm
0 references
complexity
0 references
weighted determinant maximization
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0.8751784563064575
0 references
0.8159963488578796
0 references
0.8159963488578796
0 references
0.7705832123756409
0 references
