pub struct SimulatedAnnealingOptimizer { /* private fields */ }Expand description
Simulated Annealing optimizer
Implementations§
Source§impl SimulatedAnnealingOptimizer
impl SimulatedAnnealingOptimizer
Sourcepub fn new(options: MetaheuristicSaOptions) -> Self
pub fn new(options: MetaheuristicSaOptions) -> Self
Create a new SA optimizer with the given options
Sourcepub fn optimize<F>(
&mut self,
func: F,
x0: &Array1<f64>,
) -> OptimizeResult<MetaheuristicSaResult>
pub fn optimize<F>( &mut self, func: F, x0: &Array1<f64>, ) -> OptimizeResult<MetaheuristicSaResult>
Run SA optimization on an unconstrained problem
Sourcepub fn optimize_constrained<F, G>(
&mut self,
func: F,
x0: &Array1<f64>,
constraints_fn: Option<G>,
) -> OptimizeResult<MetaheuristicSaResult>
pub fn optimize_constrained<F, G>( &mut self, func: F, x0: &Array1<f64>, constraints_fn: Option<G>, ) -> OptimizeResult<MetaheuristicSaResult>
Run SA optimization with optional constraint functions
constraints_fn returns a vector of g_i(x) values where g_i(x) > 0 means violation.
Sourcepub fn optimize_with_handler<F, G>(
&mut self,
func: F,
x0: &Array1<f64>,
constraints_fn: Option<G>,
constraint_handler: &ConstraintHandler,
) -> OptimizeResult<MetaheuristicSaResult>
pub fn optimize_with_handler<F, G>( &mut self, func: F, x0: &Array1<f64>, constraints_fn: Option<G>, constraint_handler: &ConstraintHandler, ) -> OptimizeResult<MetaheuristicSaResult>
Run SA optimization with full constraint handler configuration
Auto Trait Implementations§
impl Freeze for SimulatedAnnealingOptimizer
impl RefUnwindSafe for SimulatedAnnealingOptimizer
impl Send for SimulatedAnnealingOptimizer
impl Sync for SimulatedAnnealingOptimizer
impl Unpin for SimulatedAnnealingOptimizer
impl UnsafeUnpin for SimulatedAnnealingOptimizer
impl UnwindSafe for SimulatedAnnealingOptimizer
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> 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.