gram: The Gramacy et. al 2016 test function

In CompModels: Pseudo Computer Models for Optimization

The Gramacy et. al 2016 test function

Description

The computer model test function introduced in Gramacy et. al 2016.

Usage

gram(x1, x2)

Arguments

x1	A scalar value between 0 and 1, inclusive
x2	A scalar value between 0 and 1, inclusive

Value

The evaluation of running the Gramacy et. al 2016 test function at input (x1, x2).

• obj: A scalar objective function value

• con: A vector of constraint function values

Note

A solution is feasible only if of all of the constraint functions values are less than or equal to 0.

References

Gramacy, R.B., Gray, G.A., Digabel, S.L., Lee, H.K.H., Ranjan, P., Wells, G., and Wild, S.M. (2016). Modeling an augmented Lagrangian for blackbox constrained optimization. Technometrics, 58(1):1-11.

Examples

### Running the function at x1 = 0.2 and x2 = 0.2
### obj = 0.4 and con = (1.29,-1.42)
### (x1,x2) = (0.2,0.2) is not a feasible solution

gram(0.2,0.2)

CompModels documentation built on Oct. 20, 2022, 5:06 p.m.