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:

    “There’s one solution that ends all life’s problems.”
    —Chinese proverb.

    “I think it is a wise course for laborers to unite to defend their interests.... I think the employer who declines to deal with organized labor and to recognize it as a proper element in the settlement of wage controversies is behind the times.... Of course, when organized labor permits itself to sympathize with violent methods or undue duress, it is not entitled to our sympathy.”
    —William Howard Taft (1857–1930)