Saved in:
Bibliographic Details
Main Authors: Brilli, Andrea, Custódio, Ana L., Liuzzi, Giampaolo, Silva, Everton J.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2504.17682
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911154506301440
author Brilli, Andrea
Custódio, Ana L.
Liuzzi, Giampaolo
Silva, Everton J.
author_facet Brilli, Andrea
Custódio, Ana L.
Liuzzi, Giampaolo
Silva, Everton J.
contents In this work, we propose the joint use of a mixed penalty-interior point method and direct search, for addressing nonlinearly 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. Using CUTEst test problems, numerical experiments demonstrate the robustness, efficiency, and overall effectiveness of the proposed method, when compared with state-of-the-art solvers
format Preprint
id arxiv_https___arxiv_org_abs_2504_17682
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
Brilli, Andrea
Custódio, Ana L.
Liuzzi, Giampaolo
Silva, Everton J.
Optimization and Control
In this work, we propose the joint use of a mixed penalty-interior point method and direct search, for addressing nonlinearly 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. Using CUTEst test problems, numerical experiments demonstrate the robustness, efficiency, and overall effectiveness of the proposed method, when compared with state-of-the-art solvers
title Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
topic Optimization and Control
url https://arxiv.org/abs/2504.17682