Struct soco::problem::SimplifiedSmoothedConvexOptimization
source · [−]pub struct SimplifiedSmoothedConvexOptimization<'a, T, C, D> {
pub d: i32,
pub t_end: i32,
pub bounds: Vec<T>,
pub switching_cost: Vec<f64>,
pub hitting_cost: CostFn<'a, Config<T>, C, D>,
}
Expand description
Simplified Smoothed Convex Optimization (SSCO).
- decision space is lower bounded by $\mathbf{0}$
- movement costs are a dimension-dependently scaled Manhattan distance
Fields
d: i32
Number of dimensions.
t_end: i32
Finite, positive time horizon.
bounds: Vec<T>
Vector of upper bounds of each dimension.
switching_cost: Vec<f64>
Vector of positive real constants resembling the switching cost of each dimension.
hitting_cost: CostFn<'a, Config<T>, C, D>
Non-negative convex cost functions.
Implementations
sourceimpl<'a, T, C, D> SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
impl<'a, T, C, D> SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess + 'a,
D: ModelOutputFailure + 'a,
sourcepub fn into_sco(self) -> SmoothedConvexOptimization<'a, T, C, D>
pub fn into_sco(self) -> SmoothedConvexOptimization<'a, T, C, D>
Convert to an instance of Smoothed Convex Optimization. This assumes that time slots are added after this conversion.
Trait Implementations
sourceimpl<'a, T, C, D> BaseProblem for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: Clone,
D: Clone,
impl<'a, T, C, D> BaseProblem for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: Clone,
D: Clone,
sourceimpl<'a, T: Clone, C: Clone, D: Clone> Clone for SimplifiedSmoothedConvexOptimization<'a, T, C, D>
impl<'a, T: Clone, C: Clone, D: Clone> Clone for SimplifiedSmoothedConvexOptimization<'a, T, C, D>
sourcefn clone(&self) -> SimplifiedSmoothedConvexOptimization<'a, T, C, D>
fn clone(&self) -> SimplifiedSmoothedConvexOptimization<'a, T, C, D>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<'a, T, C, D> Debug for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Debug,
impl<'a, T, C, D> Debug for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Debug,
sourceimpl<'a, C, D> DefaultGivenOnlineProblem<f64, SimplifiedSmoothedConvexOptimization<'a, f64, C, D>, C, D> for Memory where
C: ModelOutputSuccess,
D: ModelOutputFailure,
impl<'a, C, D> DefaultGivenOnlineProblem<f64, SimplifiedSmoothedConvexOptimization<'a, f64, C, D>, C, D> for Memory where
C: ModelOutputSuccess,
D: ModelOutputFailure,
fn default(
o: &Online<FractionalSimplifiedSmoothedConvexOptimization<'_, C, D>>
) -> Self
sourceimpl<'a, T> Model<T, SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>, DataCenterOfflineInput, DataCenterOnlineInput, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
impl<'a, T> Model<T, SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>, DataCenterOfflineInput, DataCenterOnlineInput, DataCenterModelOutputSuccess, DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
sourcefn to(
&self,
_: DataCenterOfflineInput
) -> SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
fn to(
&self,
_: DataCenterOfflineInput
) -> SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>
Generates an offline problem instance given some $input$ (with certainty).
sourcefn update(
&self,
o: &mut Online<SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>>,
_: DataCenterOnlineInput
)
fn update(
&self,
o: &mut Online<SimplifiedSmoothedConvexOptimization<'a, T, DataCenterModelOutputSuccess, DataCenterModelOutputFailure>>,
_: DataCenterOnlineInput
)
Performs an online update of the given problem instance $o$ with some $input$ (which may be uncertain).
sourceimpl<'a, T, C, D> Problem<T, C, D> for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
impl<'a, T, C, D> Problem<T, C, D> for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
sourcefn objective_function<'a>(&self, xs: &Schedule<T>) -> Result<Cost<C, D>> where
T: Value<'a>,
fn objective_function<'a>(&self, xs: &Schedule<T>) -> Result<Cost<C, D>> where
T: Value<'a>,
Objective function. Calculates the cost of a schedule.
sourcefn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
Inverted Objective function. Calculates the cost of a schedule. Pays the switching cost for powering down rather than powering up. Read more
sourcefn alpha_unfair_objective_function<'a>(
&self,
xs: &Schedule<T>,
alpha: f64
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn alpha_unfair_objective_function<'a>(
&self,
xs: &Schedule<T>,
alpha: f64
) -> Result<Cost<C, D>> where
T: Value<'a>,
$\alpha$-unfair Objective function. Calculates the cost of a schedule.
sourcefn objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
Objective function starting from an initial configuration other than $\mathbf{0}$.
fn _objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>,
alpha: f64,
inverted: bool,
t_end: i32
) -> Result<Cost<C, D>> where
T: Value<'a>,
sourcefn total_movement<'a>(&self, xs: &Schedule<T>, inverted: bool) -> Result<N64> where
T: Value<'a>,
fn total_movement<'a>(&self, xs: &Schedule<T>, inverted: bool) -> Result<N64> where
T: Value<'a>,
Movement in the decision space.
fn _default_config<'a>(&self) -> Config<T> where
T: Value<'a>,
sourceimpl<'a, T, C, D> Resettable<'a> for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
impl<'a, T, C, D> Resettable<'a> for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
sourcefn reset(
&'a self,
t_start: i32
) -> SimplifiedSmoothedConvexOptimization<'a, T, C, D>
fn reset(
&'a self,
t_start: i32
) -> SimplifiedSmoothedConvexOptimization<'a, T, C, D>
Shift object to some new initial time $t_start$. Here, $t_start$ is the time before first time slot (e.g., $t_start = 0$ is a no-op).
sourceimpl<'a, T, C, D> VerifiableProblem for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
impl<'a, T, C, D> VerifiableProblem for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Value<'a>,
Auto Trait Implementations
impl<'a, T, C, D> !RefUnwindSafe for SimplifiedSmoothedConvexOptimization<'a, T, C, D>
impl<'a, T, C, D> Send for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Send,
impl<'a, T, C, D> Sync for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Sync,
impl<'a, T, C, D> Unpin for SimplifiedSmoothedConvexOptimization<'a, T, C, D> where
T: Unpin,
impl<'a, T, C, D> !UnwindSafe for SimplifiedSmoothedConvexOptimization<'a, T, C, D>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
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 more
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).
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.
fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
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 more
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).
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.
fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more