Login / Signup

A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds.

Thomas F. ColemanLaurie A. Hulbert
Published in: SIAM J. Optim. (1993)
Keyphrases
  • dynamic programming
  • learning algorithm
  • objective function
  • np hard
  • computational complexity
  • worst case
  • convex hull
  • convex optimization
  • recognition algorithm
  • global optimality
  • mathematical model