论文信息 - POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING - 字舞流文

POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING

We show that the ellipsoid algorithm of N. Z. Shor and L. G. Khachiyan, can be applied to solve convex quadratic programming problems with integer data in polynomially bounded time.

Katta G. Murty | Sung J. Chung

[1] O. L. Mangasarian,et al. Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs , 1979, Math. Oper. Res..

[2] Jong-Shi Pang,et al. On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation , 1979, Math. Program..

[3] Ikuyo Kaneko. Piecewise linear elastic–plastic analysis , 1979 .

[4] L. Khachiyan,et al. The polynomial solvability of convex quadratic programming , 1980 .

[5] H. Samelson,et al. A partition theorem for Euclidean $n$-space , 1958 .

[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[7] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .

[8] N. Z. Shor. Convergence rate of the gradient descent method with dilatation of the space , 1970 .

[9] R. Cottle,et al. On solving linear complementarity problems as linear programs , 1978 .

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

[11] Philip Wolfe,et al. Finding the nearest point in A polytope , 1976, Math. Program..

[12] Katta G. Murty,et al. On the number of solutions to the complementarity problem and spanning properties of complementary cones , 1972 .

[13] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .