Skip to main content

Problem

Struct Problem 

Source
pub struct Problem<'a, GradientType, ConstraintType, CostType, T = f64>
where GradientType: Fn(&[T], &mut [T]) -> FunctionCallResult, CostType: Fn(&[T], &mut T) -> FunctionCallResult, ConstraintType: Constraint<T>,
{ /* private fields */ }
Expand description

Definition of an optimisation problem

The definition of an optimisation problem involves:

  • the gradient of the cost function
  • the cost function
  • the set of constraints, which is described by implementations of Constraint

Implementations§

Source§

impl<'a, GradientType, ConstraintType, CostType, T> Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: Fn(&[T], &mut [T]) -> FunctionCallResult, CostType: Fn(&[T], &mut T) -> FunctionCallResult, ConstraintType: Constraint<T>,

Source

pub fn new( constraints: &'a ConstraintType, cost_gradient: GradientType, cost: CostType, ) -> Problem<'a, GradientType, ConstraintType, CostType, T>

Construct a new instance of an optimisation problem

§Arguments
  • constraints constraints
  • cost_gradient gradient of the cost function
  • cost cost function
§Returns

New instance of Problem

Auto Trait Implementations§

§

impl<'a, GradientType, ConstraintType, CostType, T> Freeze for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: Freeze, CostType: Freeze,

§

impl<'a, GradientType, ConstraintType, CostType, T> RefUnwindSafe for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: RefUnwindSafe, CostType: RefUnwindSafe, ConstraintType: RefUnwindSafe, T: RefUnwindSafe,

§

impl<'a, GradientType, ConstraintType, CostType, T> Send for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: Send, CostType: Send, ConstraintType: Sync, T: Send,

§

impl<'a, GradientType, ConstraintType, CostType, T> Sync for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: Sync, CostType: Sync, ConstraintType: Sync, T: Sync,

§

impl<'a, GradientType, ConstraintType, CostType, T> Unpin for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: Unpin, CostType: Unpin, T: Unpin,

§

impl<'a, GradientType, ConstraintType, CostType, T> UnsafeUnpin for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: UnsafeUnpin, CostType: UnsafeUnpin,

§

impl<'a, GradientType, ConstraintType, CostType, T> UnwindSafe for Problem<'a, GradientType, ConstraintType, CostType, T>
where GradientType: UnwindSafe, CostType: UnwindSafe, ConstraintType: RefUnwindSafe, T: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.