A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming |
scientific article |
Statements
A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (English)
0 references
17 January 2011
0 references
convex quadratic programming
0 references
infeasible interior point algorithm
0 references
polynomial complexity
0 references
