.png){kind=icon}
.png){kind=icon}
Return
Projection-based curve pattern search for black-box optimization over smooth convex sets
.png){kind=icon}
PRE
AI
DOI：10.1080/10556788.2026.2647280.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we deal with the problem of optimizing a black-box smooth function over a full-dimensional smooth convex set. We study sets of feasible curves that allow us to properly characterize stationarity of a solution and possibly carry out sound backtracking curvilinear searches. We then propose a general pattern search algorithmic framework that exploits curves of this type to carry out poll steps and for which we prove properties of asymptotic convergence to stationary points. We particularly point out that the proposed framework covers the case where search curves are arcs induced by the Euclidean projection of coordinate directions. The method is finally proved to arguably be superior, on smooth problems, than other recent projection-based algorithms and is competitive with state-of-the-art methods from the literature on constrained black-box optimization.
Keywords:
Pattern search methods
projection
smooth constraints
derivative-free line search
Journal
O
IF:
1.4
Papers:
31
Citations:
0