A trust-region funnel algorithm for gray-box optimization

Gul Hameed

doi:10.1002/aic.70258

Return

A trust-region funnel algorithm for gray-box optimization

2026-02-05

PRE

Gul Hameed

陈涛 (Tao Chen)

Ehecatl Antonio del Rio‐Chanona

Lorenz T. Biegler

Michael Short *

DOI：10.1002/aic.70258

Original

Original request for help

Save

Abstract

En 中文

Gray-box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black-box models lacking analytic derivatives, remains a challenge. Trust-region (TR) methods provide a robust framework for gray-box problems through local reduced models (RMs) for black-box components, but they are complex and require extensive parameter tuning. Motivated by recent advances in funnel-based convergence theory for nonlinear optimization, we propose a novel TR funnel algorithm for gray-box optimization, replacing the filter acceptance criterion with a uni-dimensional funnel, maintaining a monotonically decreasing upper bound on approximation error of local black-box RMs. A global convergence proof to a first-order critical point is established. The algorithm, implemented open-source in Pyomo, supports multiple RM forms and globalization strategies (filter or funnel). Benchmark tests show the TR funnel algorithm achieves comparable and often improved performance relative to the classical TR filter method, thus providing a simpler, effective alternative for gray-box optimization.

Keywords:

derivative-free optimization

funnel mechanism

gray-box optimization

NLP

trust-region method