An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412)
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: An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs |
scientific article; zbMATH DE number 513276
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs |
scientific article; zbMATH DE number 513276 |
Statements
An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (English)
0 references
27 March 1994
0 references
interior point method
0 references
Karmarkar's method
0 references
rank-one update
0 references
partial updating
0 references
primal-dual potential function
0 references
linear complementarity
0 references
convex quadratic programming
0 references
0 references
0 references
0 references
