pub enum OptimizerType {
LevenbergMarquardt,
GaussNewton,
DogLeg,
}Expand description
Type of optimization solver algorithm to use
Variants§
LevenbergMarquardt
Levenberg-Marquardt algorithm (robust, adaptive damping)
GaussNewton
Gauss-Newton algorithm (fast convergence, may be unstable)
DogLeg
Dog Leg algorithm (trust region method)
Trait Implementations§
Source§impl Clone for OptimizerType
impl Clone for OptimizerType
Source§fn clone(&self) -> OptimizerType
fn clone(&self) -> OptimizerType
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 Default for OptimizerType
impl Default for OptimizerType
Source§fn default() -> OptimizerType
fn default() -> OptimizerType
Returns the “default value” for a type. Read more
Source§impl Display for OptimizerType
impl Display for OptimizerType
Source§impl PartialEq for OptimizerType
impl PartialEq for OptimizerType
impl Copy for OptimizerType
impl Eq for OptimizerType
impl StructuralPartialEq for OptimizerType
Auto Trait Implementations§
impl Freeze for OptimizerType
impl RefUnwindSafe for OptimizerType
impl Send for OptimizerType
impl Sync for OptimizerType
impl Unpin for OptimizerType
impl UnwindSafe for OptimizerType
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<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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
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.