pub struct MultilevelOptimizer<F>{ /* private fields */ }Expand description
Multi-level (coarse-to-fine) optimizer
Starts at the coarsest (lowest-fidelity) level, optimizes until convergence or plateau, then promotes to the next finer level using the current solution as warm start.
Implementations§
Source§impl<F: Fn(&[f64]) -> f64> MultilevelOptimizer<F>
impl<F: Fn(&[f64]) -> f64> MultilevelOptimizer<F>
Sourcepub fn new(
levels: Vec<FidelityLevel<F>>,
x0: Vec<f64>,
options: MultilevelOptions,
) -> Self
pub fn new( levels: Vec<FidelityLevel<F>>, x0: Vec<f64>, options: MultilevelOptions, ) -> Self
Create a new multi-level optimizer
Levels should be ordered from coarsest (cheapest) to finest (most expensive).
Sourcepub fn minimize(&mut self) -> OptimizeResult<MultilevelResult>
pub fn minimize(&mut self) -> OptimizeResult<MultilevelResult>
Run the multi-level optimization
Auto Trait Implementations§
impl<F> Freeze for MultilevelOptimizer<F>
impl<F> RefUnwindSafe for MultilevelOptimizer<F>where
F: RefUnwindSafe,
impl<F> Send for MultilevelOptimizer<F>where
F: Send,
impl<F> Sync for MultilevelOptimizer<F>where
F: Sync,
impl<F> Unpin for MultilevelOptimizer<F>where
F: Unpin,
impl<F> UnsafeUnpin for MultilevelOptimizer<F>
impl<F> UnwindSafe for MultilevelOptimizer<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
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.