arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.05157math.OC
收藏

非线性约束无导数优化问题的一种内点法

An interior point method for nonlinear constrained derivative-free optimization

Andrea Brilli, Giampaolo Liuzzi, Stefano Lucidi

AI总结:

本文提出了一种基于对数障碍和二次惩罚方法的非线性约束无导数优化方法,用于解决黑箱环境下受限优化问题,并证明了其收敛性。

摘要:

本文考虑了在目标函数和约束函数均为黑箱类型的情况下,受限优化问题。此外,我们假设非线性不等式约束是非可松弛的,即其值以及目标函数值只能在可行区域内计算。这种情形在实践中经常出现,特别是在黑箱设置中,函数值通常通过复杂的模拟程序计算,如果考虑的点在可行区域外,这些程序可能会失败。针对此类问题,我们提出了一种新的无导数优化方法,该方法基于使用一个处理不等式约束的对数障碍方法和处理等式约束的二次惩罚方法的效用函数。我们证明了在相当温和的假设下,所提出的方法收敛到问题的KKT驻点。此外,我们还在标准测试问题上进行了初步数值实验,并与最先进的求解器进行了比较,展示了所提出方法的有效性。

英文摘要:

In this paper we consider constrained optimization problems where both the objective and constraint functions are of the black-box type. Furthermore, we assume that the nonlinear inequality constraints are non-relaxable, i.e. their values and that of the objective function cannot be computed outside of the feasible region. This situation happens frequently in practice especially in the black-box setting where function values are typically computed by means of complex simulation programs which may fail to execute if the considered point is outside of the feasible region. For such problems, we propose a new derivative-free optimization method which is based on the use of a merit function that handles inequality constraints by means of a log-barrier approach and equality constraints by means of a quadratic penalty approach. We prove convergence of the proposed method to KKT stationary points of the problem under quite mild assumptions. Furthermore, we also carry out a preliminary numerical experience on standard test problems and comparison with a state-of-the-art solver which shows efficiency of the proposed method.

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

↑