<p>In this work, the joint use of a mixed penalty-interior point method and direct search is proposed, to address nonlinear constrained derivative-free optimization problems. A merit function is considered, wherein the set of nonlinear inequality constraints is divided into two groups: one treated with a logarithmic barrier approach, and another, along with the equality constraints, addressed using a penalization term. This strategy is adapted and incorporated into a direct search method, enabling the effective handling of general nonlinear constraints. Convergence to KKT-stationary points is established under continuous differentiability assumptions, without requiring any kind of convexity. Computational experiments on analytical problems and an engineering application demonstrate the robustness, efficiency, and overall effectiveness of the proposed method, when compared with state-of-the-art solvers.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Nonlinear derivative-free constrained optimization with a penalty-interior point method and direct search

  • Andrea Brilli,
  • Ana L. Custódio,
  • Giampaolo Liuzzi,
  • Everton J. Silva

摘要

In this work, the joint use of a mixed penalty-interior point method and direct search is proposed, to address nonlinear constrained derivative-free optimization problems. A merit function is considered, wherein the set of nonlinear inequality constraints is divided into two groups: one treated with a logarithmic barrier approach, and another, along with the equality constraints, addressed using a penalization term. This strategy is adapted and incorporated into a direct search method, enabling the effective handling of general nonlinear constraints. Convergence to KKT-stationary points is established under continuous differentiability assumptions, without requiring any kind of convexity. Computational experiments on analytical problems and an engineering application demonstrate the robustness, efficiency, and overall effectiveness of the proposed method, when compared with state-of-the-art solvers.