An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations (Q3200887): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.15.2.342 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.15.2.342 / rank | |||
Normal rank | |||
Latest revision as of 22:10, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations |
scientific article |
Statements
An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations (English)
0 references
1990
0 references
convex quadratic programming
0 references
interior point methods
0 references
Karmarkar's algorithm
0 references
worst case bound
0 references
sequence of nested convex sets
0 references
approximate analytic center
0 references
