An algorithm for indefinite quadratic programming with convex constraints


Muu, Lê D. ; Oettli, Werner


[img]
Preview
PDF
1989_89.pdf - Published

Download (234kB)

URL: http://ub-madoc.bib.uni-mannheim.de/1976
URN: urn:nbn:de:bsz:180-madoc-19768
Document Type: Working paper
Year of publication: 1989
Publication language: English
Institution: School of Business Informatics and Mathematics > Sonstige - Fakultät für Mathematik und Informatik
MADOC publication series: Veröffentlichungen der Fakultät für Mathematik und Informatik > Institut für Mathematik > Mannheimer Manuskripte
Subject: 510 Mathematics
Classification: MSC: 90C20 90-08 90C25 ,
Subject headings (SWD): Branch-and-Bound-Methode
Keywords (English): branch-and-bound
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.
Additional information:

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.




+ Citation Example and Export

Muu, Lê D. ; Oettli, Werner (1989) An algorithm for indefinite quadratic programming with convex constraints. Open Access [Working paper]
[img]
Preview


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item