具有多极值不可微约束且无罚函数的单变量全局optimization
Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
摘要:
本文提出了一种求解约束全局最优化问题的新算法,其中目标函数和约束都是一维不可微的多极值Lipschitz函数。多极值约束可以导致复杂的可行域是具有正长度的孤立点和区间的集合。的情况下,考虑的顺序的约束进行评估是固定的问题的性质和约束$i$的定义只在一组约束$i-1$得到满足。目标函数仅在满足所有约束的集合上定义。与传统方法相比,新算法不使用任何额外的参数或变量。在算法的每次迭代期间不评估所有约束,从而提供搜索的显著加速。新算法要么找到全局最优值的上下界,要么确定问题不可行。收敛性和数值实验表明,新的方法与惩罚方法相比,一个很好的性能。
英文摘要:
This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextremal Lipschitz functions. Multiextremal constraints can lead to complex feasible regions being collections of isolated points and intervals having positive lengths. The case is considered where the order the constraints are evaluated is fixed by the nature of the problem and a constraint $i$ is defined only over the set where the constraint $i-1$ is satisfied. The objective function is defined only over the set where all the constraints are satisfied. In contrast to traditional approaches, the new algorithm does not use any additional parameter or variable. All the constraints are not evaluated during every iteration of the algorithm providing a significant acceleration of the search. The new algorithm either finds lower and upper bounds for the global optimum or establishes that the problem is infeasible. Convergence properties and numerical experiments showing a nice performance of the new method in comparison with the penalty approach are given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。