Struct SimplexConstraint 

pub struct SimplexConstraint {
    pub dim: usize,
}

Probability simplex constraint: x[i] >= 0 for all i and sum(x) = 1.

Uses the O(n log n) algorithm by Duchi et al. (2008).

Fields

dim: usize

Dimension of the simplex

Implementations

impl SimplexConstraint

pub fn new(dim: usize) -> Self

Create a new simplex constraint.

Trait Implementations

impl Clone for SimplexConstraint

fn clone(&self) -> SimplexConstraint

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SimplexConstraint

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl FastConstraint for SimplexConstraint

fn is_feasible(&self, x: &Array1<f32>) -> bool

Return true if point x satisfies this constraint

fn project(&self, x: &Array1<f32>) -> Array1<f32>

Project x onto the feasible set of this constraint. If x is already feasible, returns a clone of x.

fn violation(&self, x: &Array1<f32>) -> f32

Return the constraint violation (0 if feasible, > 0 otherwise). The violation is a non-negative scalar indicating how far x is from feasibility.