Struct optimization::ExactLineSearch [−] [src]

pub struct ExactLineSearch {
    // some fields omitted
}

Brute-force line search minimizing the objective function over a set of step width candidates, also known as exact line search.

Methods

`impl ExactLineSearch`

`fn new(start_step_width: f64, stop_step_width: f64, increase_factor: f64) -> ExactLineSearch`

Creates a new ExactLineSearch given the start_step_width, the stop_step_width and the increase_factor. The set of evaluated step widths γ is specified as { γ | γ = start_step_width · increase_factorⁱ, i ∈ N, γ <= stop_step_width }, assuming that start_step_width < stop_step_width and increase_factor > 1.

Trait Implementations

`impl LineSearch for ExactLineSearch`

`fn search<F>(&self, function: &F, initial_position: &[f64], direction: &[f64]) -> Vec<f64> where F: Function1`

Derived Implementations

`impl Clone for ExactLineSearch`

`fn clone(&self) -> ExactLineSearch`

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

`impl Copy for ExactLineSearch`

`impl Debug for ExactLineSearch`

`fn fmt(&self, __arg_0: &mut Formatter) -> Result`

Struct optimization::ExactLineSearch [−] [src]

Methods

impl ExactLineSearch

fn new(start_step_width: f64, stop_step_width: f64, increase_factor: f64) -> ExactLineSearch

Trait Implementations

impl LineSearch for ExactLineSearch

fn search<F>(&self, function: &F, initial_position: &[f64], direction: &[f64]) -> Vec<f64> where F: Function1

Derived Implementations

impl Clone for ExactLineSearch

fn clone(&self) -> ExactLineSearch

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

impl Copy for ExactLineSearch

impl Debug for ExactLineSearch

fn fmt(&self, __arg_0: &mut Formatter) -> Result