Function soco::algorithms::online::uni_dimensional::probabilistic::probabilistic

pub fn probabilistic<'a, C, D>(
    o: Online<FractionalSimplifiedSmoothedConvexOptimization<'a, C, D>>, 
    t: i32, 
    _: &FractionalSchedule, 
    prev_m: Memory<'a>, 
    options: Options
) -> Result<FractionalStep<Memory<'a>>> where
    C: ModelOutputSuccess + 'a,
    D: ModelOutputFailure + 'a, 

Probabilistic Algorithm

Assumes that the hitting costs are either smooth, i.e. infinitely many times continuously differentiable, or piecewise linear in which case the breakpoints must be provided through the options.