@@ -446,7 +446,8 @@ def optimize_acqf(
446
446
inequality_constraints: A list of tuples (indices, coefficients, rhs),
447
447
with each tuple encoding an inequality constraint of the form
448
448
`\sum_i (X[indices[i]] * coefficients[i]) >= rhs`. `indices` and
449
- `coefficients` should be torch tensors. When q=1, or when
449
+ `coefficients` should be torch tensors. See the docstring of
450
+ `make_scipy_linear_constraints` for an example. When q=1, or when
450
451
applying the same constraint to each candidate in the batch,
451
452
`indices` should be a 1-d tensor. For inter-point constraints,
452
453
`indices` must be a 2-d Tensor, where in each row `indices[i] =
@@ -455,7 +456,8 @@ def optimize_acqf(
455
456
the `l_i`-th feature of that element.
456
457
equality_constraints: A list of tuples (indices, coefficients, rhs),
457
458
with each tuple encoding an equality constraint of the form
458
- `\sum_i (X[indices[i]] * coefficients[i]) = rhs`
459
+ `\sum_i (X[indices[i]] * coefficients[i]) = rhs`. See the docstring of
460
+ `make_scipy_linear_constraints` for an example.
459
461
nonlinear_inequality_constraints: A list of callables with that represent
460
462
non-linear inequality constraints of the form `callable(x) >= 0`. Each
461
463
callable is expected to take a `(num_restarts) x q x d`-dim tensor as an
0 commit comments