Quadratic Programming - Solution Methods

Solution Methods

For general problems a variety of methods are commonly used, including

  • interior point,
  • active set,
  • augmented Lagrangian,
  • conjugate gradient,
  • gradient projection,
  • extensions of the simplex algorithm.

Convex quadratic programming is a special case of the more general field of convex optimization.

Read more about this topic:  Quadratic Programming

Famous quotes containing the words solution and/or methods:

    The truth of the thoughts that are here set forth seems to me unassailable and definitive. I therefore believe myself to have found, on all essential points, the final solution of the problems. And if I am not mistaken in this belief, then the second thing in which the value of this work consists is that it shows how little is achieved when these problems are solved.
    Ludwig Wittgenstein (1889–1951)

    The reading public is intellectually adolescent at best, and it is obvious that what is called “significant literature” will only be sold to this public by exactly the same methods as are used to sell it toothpaste, cathartics and automobiles.
    Raymond Chandler (1888–1959)