Bobyqa
This block finds the least value of a function of many variables by applying a trust region method that forms quadratic models by interpolation. Some freedom is usually present in the interpolation conditions, which are taken up by minimizing the Frobenius norm of the change to the second derivative of the model, beginning with the zero matrix. The values of the variables are constrained by upper and lower bounds.
Library
Optimization
Description
This block implements the Bobyqa optimization program in reverse communication mode. When activated, the block expects to receive on its input ports respectively the value of the optimization vector p and the associated cost. It produces then a value of p either for the next iteration expecting a cost evaluation or as the optimal solution; the output iter indicating whether or not an additional iteration is needed. If iter=0, then the optimal value of the cost associated with the optimal p is also produced on the last block output.
For more details, please refer to the section on Optimization in the Extended Definitions for Advanced Users..Parameters
| Name | Label | Description | Data Type | Valid Values |
|---|---|---|---|---|
xL | Variables lower bounds | Matrix of size Mx1 | ||
xU | Variables upper bounds | Matrix of size Mx1 | ||
RhoBeg | Initial value of the trust region | Matrix of size 1x1 | ||
RhoEnd | Final value of the trust region | Matrix of size 1x1 | ||
Npt | Number of interpolation conditions | Scalar | ||
MaxIter | Maximum number of iterations | Scalar |
Ports
| Name | Type | Description | IO Type | Number |
|---|---|---|---|---|
p0 | explicit | input | 1 | |
cost | explicit | input | 2 | |
p | explicit | output | 1 | |
iter | explicit | output | 2 | |
cost_opt | explicit | output | 3 | |
Port 6 | activation | input | 1 |