Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122)
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: Interior path following primal-dual algorithms. II: Convex quadratic programming |
scientific article; zbMATH DE number 4108480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interior path following primal-dual algorithms. II: Convex quadratic programming |
scientific article; zbMATH DE number 4108480 |
Statements
Interior path following primal-dual algorithms. II: Convex quadratic programming (English)
0 references
1989
0 references
polynomial-time algorithms
0 references
primal-dual interior point algorithm
0 references
convex quadratic programming
0 references
approximate Newton direction
0 references
logarithmic barrier function
0 references
path following
0 references
0.9516126
0 references
0.9327081
0 references
0.9285898
0 references
0.92766696
0 references
0.9262415
0 references
0.92459476
0 references
0.9206169
0 references
