Struct DEConfig

Source

pub struct DEConfig {Show 22 fields
    pub maxiter: usize,
    pub popsize: usize,
    pub tol: f64,
    pub atol: f64,
    pub mutation: Mutation,
    pub recombination: f64,
    pub strategy: Strategy,
    pub crossover: Crossover,
    pub init: Init,
    pub updating: Updating,
    pub seed: Option<u64>,
    pub integrality: Option<Vec<bool>>,
    pub x0: Option<Array1<f64>>,
    pub disp: bool,
    pub callback: Option<CallbackFn>,
    pub penalty_ineq: Vec<PenaltyTuple>,
    pub penalty_eq: Vec<PenaltyTuple>,
    pub linear_penalty: Option<LinearPenalty>,
    pub polish: Option<PolishConfig>,
    pub adaptive: AdaptiveConfig,
    pub parallel: ParallelConfig,
    pub lshade: LShadeConfig,
}

Expand description

Configuration for the Differential Evolution optimizer.

This struct holds all parameters controlling the DE algorithm behavior, including population size, mutation/crossover settings, constraints, and convergence criteria.

Fields§

§maxiter: usize

Maximum number of generations (iterations).

§popsize: usize

Population size multiplier (total NP = popsize * n_params_free).

§tol: f64

Relative tolerance for convergence (population energy std dev).

§atol: f64

Absolute tolerance for convergence on best fitness.

§mutation: Mutation

Mutation factor setting.

§recombination: f64

Crossover probability CR in [0, 1].

§strategy: Strategy

Mutation/crossover strategy.

§crossover: Crossover

Crossover type (binomial or exponential).

§init: Init

Population initialization scheme.

§updating: Updating

Update timing (deferred).

§seed: Option<u64>

Optional random seed for reproducibility.

§integrality: Option<Vec<bool>>

Optional integrality mask; true => variable is integer-constrained.

§x0: Option<Array1<f64>>

Optional initial guess used to replace the best member after init.

§disp: bool

Print objective best at each iteration.

§callback: Option<CallbackFn>

Optional per-iteration callback (may stop early).

§penalty_ineq: Vec<PenaltyTuple>

Penalty-based inequality constraints: fc(x) <= 0.

§penalty_eq: Vec<PenaltyTuple>

Penalty-based equality constraints: h(x) = 0.

§linear_penalty: Option<LinearPenalty>

Optional linear constraints treated by penalty: lb <= A x <= ub.

§polish: Option<PolishConfig>

Polishing configuration (optional).

§adaptive: AdaptiveConfig

Adaptive differential evolution configuration.

§parallel: ParallelConfig

Parallel evaluation configuration.

§lshade: LShadeConfig

L-SHADE configuration for population reduction and pbest selection.

Trait Implementations§

Source §

impl Default for DEConfig

Source §

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl !UnwindSafe for DEConfig

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §