Enum OptimizationAlgorithm 

pub enum OptimizationAlgorithm {
    PoolAdjacentViolators,
    ActiveSet,
    QuadraticProgramming,
    InteriorPoint,
    ProjectedGradient,
    DualDecomposition,
}

Optimization algorithm selection enum OptimizationAlgorithm

Variants

PoolAdjacentViolators

Pool Adjacent Violators (PAV) - fastest for unconstrained problems

ActiveSet

Active set method - good for bounded problems

QuadraticProgramming

Quadratic programming - general QP formulation

InteriorPoint

Interior point method - handles inequality constraints well

ProjectedGradient

Projected gradient - simple and robust

DualDecomposition

Dual decomposition - for large-scale problems

Implementations

impl OptimizationAlgorithm

pub fn description(&self) -> &'static str

Get a description of the algorithm

pub fn complexity(&self) -> &'static str

Get computational complexity estimate

pub fn recommend(n_samples: usize, has_bounds: bool, is_sparse: bool) -> Self

Recommend algorithm based on problem characteristics

Trait Implementations

impl Clone for OptimizationAlgorithm

fn clone(&self) -> OptimizationAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OptimizationAlgorithm

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

Formats the value using the given formatter.

impl Default for OptimizationAlgorithm

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for OptimizationAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for OptimizationAlgorithm

impl Eq for OptimizationAlgorithm

impl StructuralPartialEq for OptimizationAlgorithm