Struct NelderMeadStepper 

pub struct NelderMeadStepper { /* private fields */ }

nelder_mead as a reverse-communication state machine.

The caller asks for the next point, evaluates it, and reports the value, so many independent searches can advance in lockstep with batched evaluations. Points and arithmetic are identical to the closure-driven form: nelder_mead is this stepper driven by a closure.

Implementations

impl NelderMeadStepper

pub fn new( x0: &[f64], params: Option<NelderMeadParams>, ) -> Result<Self, EdgeErrors>

Builds the initial simplex, scipy’s, and asks for its first vertex.

Params

• x0 - Starting point
• params - Tuning knobs, or NelderMeadParams::default

Returns

The stepper, or EdgeErrors::MustBePositive if x0 is empty.

pub fn ask(&self) -> Option<&[f64]>

The point the search wants evaluated next.

Returns

The point, or None once the search has finished.

pub fn tell(&mut self, value: f64)

Hands the stepper the value at the point Self::ask returned.

Params

• value - The objective at the pending point

pub fn result(&self) -> NelderMeadResult

The best vertex found so far.

Returns

The result; meaningful once Self::ask returns None.

Trait Implementations

impl Clone for NelderMeadStepper

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 NelderMeadStepper

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

Formats the value using the given formatter.