pub enum SimplexExpansionMethod {
GreedyMinimization,
GreedyExpansion,
}
Expand description
Selects the expansion method used in the Nelder-Mead algorithm. See Lagarias et al.1 for more details.
Variants§
GreedyMinimization
Greedy minimization will calculate both a reflected an expanded point in an expansion step but will return the one that gives the best minimum.
GreedyExpansion
Greedy expansion will calculate both a reflected and expanded point in an expansion step but will return the expanded point always, even if the reflected point is a better minimum.
Trait Implementations§
Source§impl Clone for SimplexExpansionMethod
impl Clone for SimplexExpansionMethod
Source§fn clone(&self) -> SimplexExpansionMethod
fn clone(&self) -> SimplexExpansionMethod
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for SimplexExpansionMethod
impl Debug for SimplexExpansionMethod
Source§impl Default for SimplexExpansionMethod
impl Default for SimplexExpansionMethod
Source§fn default() -> SimplexExpansionMethod
fn default() -> SimplexExpansionMethod
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for SimplexExpansionMethod
impl RefUnwindSafe for SimplexExpansionMethod
impl Send for SimplexExpansionMethod
impl Sync for SimplexExpansionMethod
impl Unpin for SimplexExpansionMethod
impl UnwindSafe for SimplexExpansionMethod
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.