A new algorithm for quadratic programmin
β
TamΓ‘s Terlaky
π
Article
π
1987
π
Elsevier Science
π
English
β 531 KB
We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does.