A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming |
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
