Convex quadratic programming with one constraint and bounded variables

This publication has 8 references indexed in Scilit:

• A polynomially bounded algorithm for a singly constrained quadratic program
  Mathematical Programming, 1980
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
  Operations Research, 1980
• Finding the nearest point in A polytope
  Mathematical Programming, 1976
• On the Goldstein-Levitin-Polyak gradient projection method
  IEEE Transactions on Automatic Control, 1976
• Monotone solutions of the parametric linear complementarity problem
  Mathematical Programming, 1972
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970
• Constrained minimization methods
  USSR Computational Mathematics and Mathematical Physics, 1966
• Convex programming in Hilbert space
  Bulletin of the American Mathematical Society, 1964