论文信息 - On Quadratic Programming

On Quadratic Programming

A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. If a general quadratic program has an optimum and satisfies a non-degeneracy condition then it is demonstrated that there are an odd number of stationary points.

B. Eaves

[1] G. Dantzig,et al. Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[2] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[3] A. J. Goldman. 3 . Resolution and Separation Theorems for Polyhedral Convex Sets , 1957 .

[4] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[5] C. E. Lemke,et al. QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES. , 1967 .

[6] G. Dantzig,et al. On the continuity of the minimum set of a continuous function , 1967 .

[7] H. L. Le Roy,et al. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[8] B. Eaves. The Linear Complementarity Problem , 1971 .