English

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search

Optimization and Control 2026-01-19 v3

Abstract

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.

Keywords

Cite

@article{arxiv.2407.21634,
  title  = {Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search},
  author = {Andrea Brilli and Ana L. Custódio and Giampaolo Liuzzi and Everton J. Silva},
  journal= {arXiv preprint arXiv:2407.21634},
  year   = {2026}
}

Comments

Previously this version appeared as arXiv:2504.17682 which was submitted as a new work by accident

R2 v1 2026-06-28T17:59:23.561Z