An algorithm for minimizing a convex-concave function over a convex set


Muu, Lê D. ; Oettli, Werner


[img]
Preview
PDF
1989_92.pdf - Published

Download (199kB)

URL: http://ub-madoc.bib.uni-mannheim.de/1980
URN: urn:nbn:de:bsz:180-madoc-19808
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
Subject headings (SWD): Branch-and-Bound-Methode , Minimierung , Konvexe Funktion , Konkave Funktion
Abstract: A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. The minimization of a dc-function is a special case, where the subproblems connected with the bounding operation can be solved effectively.
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 minimizing a convex-concave function over a convex set. 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