Skip to main content
Article thumbnail
Location of Repository

An algorithm for indefinite quadratic programming with convex constraints

By Lê D. Muu and Werner Oettli


We propose a branch-and-bound method for minimizing an indefinite quadratic function over a convex set. The bounding operation is based on a certain relaxation of the constraints

Topics: 510 Mathematik
Year: 1989
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.