pub struct BobyqaStepper { /* private fields */ }Expand description
bobyqa as a reverse-communication state machine.
Self::ask gives the next point, Self::tell its value. The arithmetic
is NLopt’s, so for identical values the sequence of points is NLopt’s.
Implementations§
Source§impl BobyqaStepper
impl BobyqaStepper
Sourcepub fn new(
x0: &[f64],
lower: &[f64],
upper: &[f64],
params: Option<BobyqaParams>,
) -> Result<Self, EdgeErrors>
pub fn new( x0: &[f64], lower: &[f64], upper: &[f64], params: Option<BobyqaParams>, ) -> Result<Self, EdgeErrors>
Sets up the search as nlopt_optimize and bobyqa do, and asks for the
first point.
§Params
x0- Starting point, inside the boxlower- Lower bounds, finiteupper- Upper bounds, finite and abovelowerparams- Stopping knobs, or nloptr’s defaults
§Returns
The stepper, or EdgeErrors::InvalidArgument when the box is too
narrow for the initial radius, as NLopt refuses it.
Sourcepub fn ask(&self) -> Option<&[f64]>
pub fn ask(&self) -> Option<&[f64]>
The point the search wants evaluated next.
§Returns
The point on the caller’s scale, or None once the search has finished.
Sourcepub fn result(&self) -> BobyqaResult
pub fn result(&self) -> BobyqaResult
Auto Trait Implementations§
impl Freeze for BobyqaStepper
impl RefUnwindSafe for BobyqaStepper
impl Send for BobyqaStepper
impl Sync for BobyqaStepper
impl Unpin for BobyqaStepper
impl UnsafeUnpin for BobyqaStepper
impl UnwindSafe for BobyqaStepper
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.