Struct Minimum 

pub struct Minimum {
    pub x: Vec<f64>,
    pub value: f64,
    pub iterations: usize,
    pub converged: bool,
}

The result of nelder_mead: the best point found, its value, the number of simplex moves made and whether the tolerance was met.

use prospicio_math::optimize::{nelder_mead, NelderMead};

let m = nelder_mead(|x| (x[0] - 3.0).powi(2), &[0.0], &NelderMead::default());
assert!(m.converged && (m.x[0] - 3.0).abs() < 1e-8 && m.value < 1e-16);

Fields

x: Vec<f64>

The best point found.

value: f64

f(x), or +inf if no feasible point was found.

iterations: usize

Simplex moves made.

converged: bool

Whether the last pass met the tolerance within max_iterations.

Trait Implementations

impl Clone for Minimum

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Minimum

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

Formats the value using the given formatter.

impl PartialEq for Minimum

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Minimum