A long-step barrier method for convex quadratic programming (Q689102)
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 long-step barrier method for convex quadratic programming |
scientific article; zbMATH DE number 440021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A long-step barrier method for convex quadratic programming |
scientific article; zbMATH DE number 440021 |
Statements
A long-step barrier method for convex quadratic programming (English)
0 references
6 December 1993
0 references
interior-point method
0 references
polynomial algorithm
0 references
long-step logarithmic barrier function
0 references
convex quadratic programming
0 references
linear equality constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9014413
0 references
0.8972367
0 references
0.8966489
0 references
0.8962973
0 references
0.8955192
0 references
0.89245534
0 references
0.8917515
0 references
0.89162934
0 references
0.89056003
0 references
