Deletion-by-infeasibility rule for DC-constrained global optimization |
| |
Authors: | J Fülöp |
| |
Institution: | (1) Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary |
| |
Abstract: | In Ref. 1, a general class of branch-and-bound methods was proposed by Horst for solving global optimization problems. One of the main contributions of Ref. 1 was the opportunity of handling partition elements whose feasibility is not known. Deletion-by-infeasibility rules were presented for problems where the feasible set is convex, is defined by finitely many convex and reverse convex constraints, or is defined by Lipschitzian inequalities. In this note, we propose a new deletion-by-infeasibility rule for problems whose feasible set is defined by functions representable as differences of convex functions.This research was supported in part by the Hungarian National Research Foundation, Grant OTKA No. 2568. |
| |
Keywords: | Global optimization nonconvex programming mathematical programming DC-programming branch-and-bound methods |
本文献已被 SpringerLink 等数据库收录! |
|