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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#![recursion_limit = "1024"]
#![cfg_attr(feature = "clippy", feature(plugin))]
#![cfg_attr(feature = "clippy", plugin(clippy))]
#![warn(missing_docs)]
#[macro_use]
extern crate error_chain;
extern crate ndarray;
extern crate ndarray_linalg;
extern crate num;
extern crate rand;
#[macro_use]
pub mod macros;
use std::default::Default;
use num::ToPrimitive;
use errors::*;
use parameter::ArgminParameter;
use result::ArgminResult;
pub trait ArgminCostValue: ToPrimitive + Copy + Default + PartialOrd {}
impl<T> ArgminCostValue for T
where
T: ToPrimitive + Copy + Default + PartialOrd,
{
}
pub trait ArgminSolver<'a> {
type Parameter: ArgminParameter;
type CostValue: ArgminCostValue;
type Hessian;
type StartingPoints;
type ProblemDefinition;
fn init(&mut self, &'a Self::ProblemDefinition, &Self::StartingPoints) -> Result<()>;
fn next_iter(&mut self) -> Result<ArgminResult<Self::Parameter, Self::CostValue>>;
fn run(
&mut self,
&'a Self::ProblemDefinition,
&Self::StartingPoints,
) -> Result<ArgminResult<Self::Parameter, Self::CostValue>>;
fn terminate(&self) -> bool;
}
pub mod result;
pub mod parameter;
pub mod problem;
pub mod operator;
pub mod testfunctions;
pub mod backtracking;
pub mod sa;
pub mod gradientdescent;
pub mod neldermead;
pub mod newton;
pub mod landweber;
pub mod cg;
mod errors;
#[cfg(test)]
mod tests {
#[test]
fn it_works() {
assert_eq!(2 + 2, 4);
}
}