Enum Algorithm 

pub enum Algorithm {
    Newton,
    Bfgs,
    Lbfgs,
}

The algorithm to use for optimization. One of: ‘BFGS’, ‘LBFGS’, ‘Newton’.

Variants

Newton

Use the Newton algorithm.

Bfgs

Use the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm.

Lbfgs

Use the Limited-memory BFGS (L-BFGS) algorithm.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Display for Algorithm

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

Formats the value using the given formatter.

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> 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 Algorithm

impl Eq for Algorithm

impl StructuralPartialEq for Algorithm