An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01588795 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075023395 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 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
0 references
0 references
0 references
0 references
0 references
