mgh 0.1.16

A Collection of Moré-Garbow-Hilstrom https://dl.acm.org/doi/pdf/10.1145/355934.355936
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

pub fn penalty1(x: &[f64]) -> f64 {
    let a: f64 = 0.00001;
    let mut res = 0.0;
    for item in x {
        // f_i(x) = sqrt(a)(x_i - 1)
        let f = a.sqrt() * (item - 1.);
        res += f.powi(2);
    }
    res += {
        let mut r = 0.;
        for item in x {
            r += item.powi(2);
        }
        // f_{n+1}(x) = (sum x_j^2) - 1/4
        (r - 0.25).powi(2)
    };
    res
}

pub fn init(n: usize) -> Vec<f64> {
    let mut vec = vec![0.; n];
    for (i, item) in vec.iter_mut().enumerate().take(n) {
        *item = i as f64 + 1.;
    }
    vec
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_penalty1() {
        let n = 3;
        let x = init(n);
        let val = penalty1(&x);
        assert!(val.is_finite());
    }
}