pub struct IterationReport {
pub iteration: usize,
pub fidelity: f64,
pub penalty: f64,
pub cost: f64,
pub grad_norm: Option<f64>,
pub evaluations: usize,
pub elapsed_s: f64,
}Expand description
One row of progress.
Fields§
§iteration: usizeIteration number; 0 is the starting point for gradient methods. For derivative-free methods an
iteration is one function evaluation, counted from 1.
fidelity: f64Mean fidelity.
penalty: f64Amplitude penalty.
cost: f64penalty − fidelity.
grad_norm: Option<f64>Gradient norm, for gradient methods.
evaluations: usizeObjective evaluations so far.
elapsed_s: f64Seconds since the optimiser started.
Trait Implementations§
Source§impl Clone for IterationReport
impl Clone for IterationReport
Source§impl Debug for IterationReport
impl Debug for IterationReport
Source§impl<'de> Deserialize<'de> for IterationReport
impl<'de> Deserialize<'de> for IterationReport
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for IterationReport
impl PartialEq for IterationReport
Source§impl Serialize for IterationReport
impl Serialize for IterationReport
impl StructuralPartialEq for IterationReport
Auto Trait Implementations§
impl Forget for IterationReport
impl Freeze for IterationReport
impl Move for IterationReport
impl RefUnwindSafe for IterationReport
impl Send for IterationReport
impl Sync for IterationReport
impl Unpin for IterationReport
impl UnsafeUnpin for IterationReport
impl UnwindSafe for IterationReport
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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,
impl<T> Scalar for T
impl<T> SendAlias 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.