pub struct MfRbf<FL, FH>{
pub low_fi: FL,
pub high_fi: FH,
pub options: MfRbfOptions,
/* private fields */
}Expand description
Multi-fidelity RBF surrogate with additive correction.
Builds a correction surface δ(x) = f_H(x) - f_L(x) using RBF interpolation on a small number of high-fidelity samples, then optimizes f_L(x) + δ̂(x).
Fields§
§low_fi: FLLow-fidelity model
high_fi: FHHigh-fidelity model
options: MfRbfOptionsAlgorithm options
Implementations§
Source§impl<FL, FH> MfRbf<FL, FH>
impl<FL, FH> MfRbf<FL, FH>
Sourcepub fn new(low_fi: FL, high_fi: FH, options: MfRbfOptions) -> Self
pub fn new(low_fi: FL, high_fi: FH, options: MfRbfOptions) -> Self
Create a new MfRbf optimizer
Sourcepub fn add_sample(&mut self, x: Vec<f64>)
pub fn add_sample(&mut self, x: Vec<f64>)
Add a sample (evaluate both fidelities)
Sourcepub fn eval_corrected(&self, x: &[f64]) -> f64
pub fn eval_corrected(&self, x: &[f64]) -> f64
Evaluate the corrected surrogate: f_L(x) + δ̂(x)
Sourcepub fn minimize(&mut self, x0: &[f64]) -> OptimizeResult<MultilevelResult>
pub fn minimize(&mut self, x0: &[f64]) -> OptimizeResult<MultilevelResult>
Run the MFRBF optimization
Auto Trait Implementations§
impl<FL, FH> Freeze for MfRbf<FL, FH>
impl<FL, FH> RefUnwindSafe for MfRbf<FL, FH>where
FL: RefUnwindSafe,
FH: RefUnwindSafe,
impl<FL, FH> Send for MfRbf<FL, FH>
impl<FL, FH> Sync for MfRbf<FL, FH>
impl<FL, FH> Unpin for MfRbf<FL, FH>
impl<FL, FH> UnsafeUnpin for MfRbf<FL, FH>where
FL: UnsafeUnpin,
FH: UnsafeUnpin,
impl<FL, FH> UnwindSafe for MfRbf<FL, FH>where
FL: UnwindSafe,
FH: 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.