论文信息 - A Comparison of Two Methods for Quadratic Programming

A Comparison of Two Methods for Quadratic Programming

The paper gives a comparison of Beale's method for quadratic programming and the Simplex Method for quadratic programming as developed by Dantzig and Van de Panne and Whinston. After summary expositions of both methods and a reformulation of Beale's method in the framework of quadratic Simplex tableaux, the relation between the two methods is analyzed. A numerical example is used as illustration.

Andrew Whinston | C. van de Panne

[1] Andrew B. Whinston,et al. Simplicial methods for quadratic programming , 1964 .

[2] E. Beale. On quadratic proramming , 1959 .

[3] C. Panne,et al. The Simplex and the Dual Method for Quadratic Programming , 1964 .

[4] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[5] P. Wolfe. THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .

[6] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.

[7] E. Beale. ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .