Location of Repository

An algorithm for indefinite quadratic programming with convex constraints

By Lê D. Muu and Werner Oettli

Abstract

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: oai:ub-madoc.bib.uni-mannheim.de:1976

Suggested articles

Preview


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