pub struct CmaEsTolerance<F = f64> { /* private fields */ }Expand description
CMA-ES TolX convergence test (Hansen 2016 Appendix B.3): stop when
the largest standard deviation of any axis of the search
distribution drops below tol_x, i.e. σ · maxᵢ dᵢ < tol_x (where
dᵢ are the square roots of C’s eigenvalues).
Binds on the concrete CmaEsState — the canonical convergence
criterion for both CmaEs and
BoundedCmaEs, which share that
state. The Hansen-recommended default is 1e−12 · initial_sigma
(scaled by maxᵢ stdsᵢ when an anisotropic initial covariance is
used, to stay relative to the initial spread).
Implementations§
Source§impl<F> CmaEsTolerance<F>
impl<F> CmaEsTolerance<F>
Trait Implementations§
Source§impl<V, M, F> TerminationCriterion<CmaEsState<V, M, F>> for CmaEsTolerance<F>
impl<V, M, F> TerminationCriterion<CmaEsState<V, M, F>> for CmaEsTolerance<F>
Source§fn check(&mut self, state: &CmaEsState<V, M, F>) -> Option<TerminationReason>
fn check(&mut self, state: &CmaEsState<V, M, F>) -> Option<TerminationReason>
Inspect the current state and return
Some(reason) to halt the
run, or None to continue. Called once per iteration before the
solver’s next_iter.Auto Trait Implementations§
impl<F> Freeze for CmaEsTolerance<F>where
F: Freeze,
impl<F> RefUnwindSafe for CmaEsTolerance<F>where
F: RefUnwindSafe,
impl<F> Send for CmaEsTolerance<F>where
F: Send,
impl<F> Sync for CmaEsTolerance<F>where
F: Sync,
impl<F> Unpin for CmaEsTolerance<F>where
F: Unpin,
impl<F> UnsafeUnpin for CmaEsTolerance<F>where
F: UnsafeUnpin,
impl<F> UnwindSafe for CmaEsTolerance<F>where
F: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.