Global optimization problems and domain reduction strategies |
| |
Authors: | Alberto Caprara Marco Locatelli |
| |
Affiliation: | (3) School of Economics and Business Engineering, University of Karlsruhe, Karlsruhe, Germany; |
| |
Abstract: | In this paper we discuss domain reduction strategies for global optimization problems with a nonconvex objective function over a bounded convex feasible region. After introducing a standard domain reduction and its iterated version, we will introduce a new reduction strategy. Under mild assumptions, we will prove the equivalence between the new domain reduction and the iterated version of the standard one, allowing a new interpretation of the latter and a new way of computing it. Finally, we prove that any “reasonable” domain reduction strategy is independent of the order by which variables are processed. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|