An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:40, 4 February 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
