simplers_optimization 0.2.0

A Rust implementation of the Simple(x) black-box optimization algorithm.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

mod point;
mod simplex;
mod search_space;
mod algorithm;
pub use algorithm::Optimizer;

fn main()
{
   //let nb_iter = 50;

   /*{
      // this function is particularly noisy
      const DIM: usize = 5;
      let hypercube = vec![(-32.768, 32.768); DIM];
      let f = argmin_testfunctions::ackley;
      let (value, _coordinate) = Optimizer::minimize(f, hypercube, nb_iter);
      println!("Finished! found {} (target:0)", value);
   }*/
   /*
      {
         let hypercube = vec![(0., 1.), (0., 1.)];
         let f = argmin_testfunctions::picheny;
         let (value, coordinate) = Optimizer::minimize(f, hypercube, nb_iter);
         println!("Finished! found {} in {:?} (target:-3.3851993182036826)", value, coordinate);
      }
   *//*
      {
         // this function has several similar minimums
         let hypercube = vec![(-5., 5.), (-5., 5.)];
         let f = argmin_testfunctions::himmelblau;
         let (value, coordinate) = Optimizer::minimize(f, hypercube, nb_iter);
         println!("Finished! found {} in {:?} (target:0)", value, coordinate);
      }*/
}