arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1103.3791math.OCcs.NAmath.NA
收藏

多极值约束下全局Optimization的索引分枝定界算法

Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints

Yaroslav D. Sergeyev, Domenico Famularo, Paolo Pugliese

摘要:

本文研究了目标函数和约束条件均为多极值的单变量Lipschitz约束全局最优化问题。该方法在不引入附加参数和变量的情况下,将约束问题转化为不连续的无约束问题。提出了一种不使用导数的分支定界法来求解简化问题。该方法要么确定原问题的不可行性,要么找到全局解的上下界上界。在算法的每次迭代期间,并不是所有的约束都被评估,这提供了搜索的显著加速。建立了新方法的收敛条件。测试问题和广泛的数值实验。

英文摘要:

In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A Branch-and-Bound method that does not use derivatives for solving the reduced problem is proposed. The method either determines the infeasibility of the original problem or finds lower and upper bounds for the global solution. Not all the constraints are evaluated during every iteration of the algorithm, providing a significant acceleration of the search. Convergence conditions of the new method are established. Test problems and extensive numerical experiments are presented.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑