An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677)
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: An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity |
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
