An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677): 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/01630560701277930 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2103299621 / rank | |||
Normal rank |
Revision as of 18:41, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity |
scientific article |
Statements
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (English)
0 references
4 June 2007
0 references
convex quadratic programming
0 references
infeasible interior point algorithm
0 references
Mizuno-Todd-Ye type algorithm
0 references
polynomial time complexity
0 references
convergence
0 references