givp¶
givp.givp ¶
givp(
func: ObjectiveFn,
bounds: BoundsLike,
*,
num_vars: int | None = None,
minimize: bool | None = None,
direction: str | None = None,
config: GIVPConfig | None = None,
initial_guess: Sequence[float] | None = None,
initial_guesses: (
Sequence[Sequence[float]] | None
) = None,
iteration_callback: IterationCallback | None = None,
seed: int | None = None,
verbose: bool = False
) -> OptimizeResult
Minimize (or maximize) a scalar function with GRASP-ILS-VND-PR.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
func
|
ObjectiveFn
|
Objective callable mapping a 1-D |
required |
bounds
|
BoundsLike
|
Either a sequence of |
required |
num_vars
|
int | None
|
Optional explicit number of variables. Inferred from
|
None
|
minimize
|
bool | None
|
Boolean flag for the optimization sense. |
None
|
direction
|
str | None
|
|
None
|
config
|
GIVPConfig | None
|
Algorithm hyper-parameters. |
None
|
initial_guess
|
Sequence[float] | None
|
Optional warm-start vector, evaluated and inserted in the elite pool before the first iteration. |
None
|
initial_guesses
|
Sequence[Sequence[float]] | None
|
Optional collection of warm-start vectors to seed the elite pool with multiple known-good solutions. |
None
|
iteration_callback
|
IterationCallback | None
|
Optional callable invoked once per outer iteration
with |
None
|
seed
|
int | None
|
Optional integer seed for full reproducibility. When given, every internal RNG is derived deterministically from this seed, so two calls with the same inputs return the same result. |
None
|
verbose
|
bool
|
If True, prints progress information to stdout. |
False
|
Returns:
| Name | Type | Description |
|---|---|---|
OptimizeResult |
OptimizeResult
|
Dataclass with |
OptimizeResult
|
objective value in the user's original sign) and metadata. |
Raises:
| Type | Description |
|---|---|
ValueError
|
If both |