POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, notwithstanding any copyright notation hereon.

This publication has 9 references indexed in Scilit:

• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
  Mathematical Programming, 1979
• Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
  Mathematics of Operations Research, 1979
• Piecewise linear elastic-plastic analysis
  International Journal for Numerical Methods in Engineering, 1979
• On solving linear complementarity problems as linear programs
  Published by Springer Nature ,1978
• Convergence rate of the gradient descent method with dilatation of the space
  Cybernetics and Systems Analysis, 1973
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
  Linear Algebra and its Applications, 1972
• Complementary pivot theory of mathematical programming
  Linear Algebra and its Applications, 1968
• Bimatrix Equilibrium Points and Mathematical Programming
  Management Science, 1965
• Equilibrium Points of Bimatrix Games
  Journal of the Society for Industrial and Applied Mathematics, 1964