An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming |
scientific article |
Statements
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (English)
0 references
1991
0 references
Karmarkar's method
0 references
primal interior point method
0 references
convex quadratic programming
0 references
logarithmic barrier function
0 references
