A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/01630563.2010.520217 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040781450 / rank | |||
Normal rank | |||
Revision as of 20:59, 19 March 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
