Struct smoothed_online_convex_optimization::algorithms::online::uni_dimensional::randomized::Relaxation [−][src]
pub struct Relaxation<M>(pub PhantomData<M>);Tuple Fields
0: PhantomData<M>Trait Implementations
impl<'a, C, D> ExecutableRelaxation<'a, Memory, C, D> for Relaxation<RandomlyBiasedGreedyMemory> where
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
impl<'a, C, D> ExecutableRelaxation<'a, Memory, C, D> for Relaxation<RandomlyBiasedGreedyMemory> where
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
fn execute(
relaxation_o: Online<FractionalSimplifiedSmoothedConvexOptimization<'a, C, D>>,
xs: &FractionalSchedule,
prev_m: Option<RandomlyBiasedGreedyMemory>
) -> Result<FractionalStep<RandomlyBiasedGreedyMemory>>
impl<'a, C, D> ExecutableRelaxation<'a, Memory<'a>, C, D> for Relaxation<ProbabilisticMemory<'a>> where
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
impl<'a, C, D> ExecutableRelaxation<'a, Memory<'a>, C, D> for Relaxation<ProbabilisticMemory<'a>> where
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
fn execute(
relaxation_o: Online<FractionalSimplifiedSmoothedConvexOptimization<'a, C, D>>,
xs: &FractionalSchedule,
prev_m: Option<ProbabilisticMemory<'a>>
) -> Result<FractionalStep<ProbabilisticMemory<'a>>>
Auto Trait Implementations
impl<M> RefUnwindSafe for Relaxation<M> where
M: RefUnwindSafe,
impl<M> Send for Relaxation<M> where
M: Send,
impl<M> Sync for Relaxation<M> where
M: Sync,
impl<M> Unpin for Relaxation<M> where
M: Unpin,
impl<M> UnwindSafe for Relaxation<M> where
M: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.