simplers_optimization 0.4.3

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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

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

fn main()
{
   {
      let f = |v: &[f64]| v[0] * v[1];
      let input_interval = vec![(-10., 10.), (-20., 20.)];
      let should_minimize = true;

      // runs the search for 30 iterations
      // then waits until we find a point good enough
      // finally stores the best value so far
      let (min_value, coordinates) =
         Optimizer::new(&f, &input_interval, should_minimize).skip(30)
                                                             .skip_while(|(value, __coordinates)| *value > 1.)
                                                             .next()
                                                             .unwrap();

      println!("min value: {} found in [{}, {}]", min_value, coordinates[0], coordinates[1]);
   }

   {
      let f = |v: &[f64]| v[0] + v[1];
      let input_interval = vec![(-10., 10.), (-20., 20.)];
      let nb_iterations = 100;
      let (max_value, coordinates) = Optimizer::maximize(&f, &input_interval, nb_iterations);
      println!("max value: {} found in [{}, {}]", max_value, coordinates[0], coordinates[1]);
   }

   {
      let f = |v: &[f64]| v[0] * v[1];
      let input_interval = vec![(-10., 10.), (-20., 20.)];
      let should_minimize = true;

      // runs the search for 30 iterations
      // then waits until we find a point good enough
      // finally stores the best value so far
      let (min_value, coordinates) =
         Optimizer::new(&f, &input_interval, should_minimize).skip(30)
                                                             .skip_while(|(value, __coordinates)| *value > 1.)
                                                             .next()
                                                             .unwrap();

      println!("min value: {} found in [{}, {}]", min_value, coordinates[0], coordinates[1]);
   }
}