Enum OptimizationProblem 

pub enum OptimizationProblem {
    Unconstrained,
    EqualityConstrained,
    InequalityConstrained,
    QuadraticProgram,
    LinearProgram,
    SemidefiniteProgram,
}

Types of optimization problems

Variants

Unconstrained

Unconstrained optimization: min f(x, θ)

EqualityConstrained

Equality constrained: min f(x, θ) s.t. g(x, θ) = 0

InequalityConstrained

Inequality constrained: min f(x, θ) s.t. h(x, θ) ≤ 0

QuadraticProgram

Quadratic programming: min 0.5 x^T Q x + c^T x s.t. Ax = b, Gx ≤ h

LinearProgram

Linear programming: min c^T x s.t. Ax = b, x ≥ 0

SemidefiniteProgram

Semidefinite programming

Trait Implementations

impl Clone for OptimizationProblem

fn clone(&self) -> OptimizationProblem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OptimizationProblem

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

Formats the value using the given formatter.

impl PartialEq for OptimizationProblem

fn eq(&self, other: &OptimizationProblem) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for OptimizationProblem