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. the values of the objective function and constraints 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 an exterior penalty approach. We prove the convergence of the proposed method to KKT stationary points of the problem under standard assumptions (we do not require any convexity assumption). Furthermore, we also carry out a preliminary numerical experience on standard test problems and comparison with state-of-the-art solvers showing the efficiency of the proposed method.

An interior point method for nonlinear constrained derivative-free optimization / Brilli, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1029-4937. - 40:3(2025), pp. 611-649. [10.1080/10556788.2025.2453110]

An interior point method for nonlinear constrained derivative-free optimization

ANDREA BRILLI
Primo
;
GIAMPAOLO LIUZZI
;
STEFANO LUCIDI
2025

Abstract

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. the values of the objective function and constraints 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 an exterior penalty approach. We prove the convergence of the proposed method to KKT stationary points of the problem under standard assumptions (we do not require any convexity assumption). Furthermore, we also carry out a preliminary numerical experience on standard test problems and comparison with state-of-the-art solvers showing the efficiency of the proposed method.
2025
derivative-free optimization; nonlinear programming; interior point methods
01 Pubblicazione su rivista::01a Articolo in rivista
An interior point method for nonlinear constrained derivative-free optimization / Brilli, Andrea; Liuzzi, Giampaolo; Lucidi, Stefano. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1029-4937. - 40:3(2025), pp. 611-649. [10.1080/10556788.2025.2453110]
File allegati a questo prodotto
File Dimensione Formato  
Brilli_An-interior-point_2025.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 4.83 MB
Formato Adobe PDF
4.83 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1726247
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact