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:

    “Let us begin to understand the argument.
    There is a solution to everything: Science.”
    —Allen Tate (1899–1979)

    “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)