An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs |
scientific article |
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
