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

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.

Authors

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2026-04-01
DOI
https://doi.org/10.1007/s11075-026-02360-5
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Everton J. Silva, Andrea Brilli, Giampaolo Liuzzi, Ana L. Custódio
Numerical Algorithms
Advanced Optimization Algorithms Research
article

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

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

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.

Numerical Algorithms
National Research Council (IT), Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti (IT), Universidade Nova de Lisboa (PT), Sapienza University of Rome (IT)
Polytechnique Montréal
Peace, Justice and strong institutions
Openalex Percentile: Top 7%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Nonlinear derivative-free constrained optimization with a penalty-interior point method and direct search — Everton J. Silva, Andrea Brilli, et al. · Numerical Algorithms (2026) | TGRS Research Map | TGRS