.png){kind=icon}
.png){kind=icon}
Return
A feasible method for constrained derivative-free optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.orl.2025.107398.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates a method for solving constrained optimization problems when the derivatives of the objective function are unavailable, while the derivatives of the constraint functions are known. We allow the objective and constraint function to be nonconvex. The method constructs a quadratic model of the objective function via interpolation and computes a step by minimizing this model subject to the original constraints in the problem and a trust region constraint. The step computation requires the solution of a general nonlinear program, which is economically feasible when the constraints and their derivatives are very inexpensive to compute compared to the objective function. The paper includes a summary of numerical results that highlight the method's promising potential.
Keywords:
Derivative-free optimization
Constrained optimization
Nonlinear optimization
Journal
O
IF:
0.9
Papers:
52
Citations:
3.5K