Method for minimizing a convex-concave function over a convex set |
| |
| Authors: | L D Muu W Oettli |
| |
| Institution: | (1) Institute of Mathematics, Hanoi, Vietnam;(2) Fakultät für Mathematik und Informatik, Universität Mannheim, Mannheim, Germany |
| |
| 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.on leave at Mannheim University by a grant from the Alexander von Humboldt Foundation. |
| |
| Keywords: | Global optimization branch-and-bound methods convex-concave functions DC-problems |
| 本文献已被 SpringerLink 等数据库收录！ |
|
