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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
/* -*- mia-c++ -*-
*
* This file is part of MIA - a toolbox for medical image analysis
* Copyright (c) Leipzig, Madrid 1999-2016 Gert Wollny
*
* MIA is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with MIA; if not, see <http://www.gnu.org/licenses/>.
*
*/
#define BOOST_TEST_MODULE MINIMIZER_TEST
#include <config.h>
#include <mia/internal/autotest.hh>
#include <mia/core/minimizer.hh>
#include <mia/core/cmdlineparser.hh>
#include <mia/core/msgstream.hh>
#include <numeric>
using namespace std;
using namespace mia;
using namespace boost;
namespace bfs =::boost::filesystem;
void compare_sets(const set< string >& plugins, const set<string>& test_data)
{
BOOST_CHECK_EQUAL(plugins.size(), test_data.size());
for (auto p = plugins.begin(); p != plugins.end(); ++p) {
BOOST_CHECK_MESSAGE(test_data.find(*p) != test_data.end(), "unexpected plugin '" << *p << "' found");
}
for (auto p = test_data.begin(); p != test_data.end(); ++p)
BOOST_CHECK_MESSAGE(plugins.find(*p) != plugins.end(), "expected plugin '" << *p << "' not found");
}
class CMinimizerMock : public CMinimizer
{
private:
int do_run(CDoubleVector& x);
};
class CProblemMock : public CMinimizer::Problem
{
private:
virtual double do_f(const CDoubleVector& x);
virtual void do_df(const CDoubleVector& x, CDoubleVector& g);
virtual double do_fdf(const CDoubleVector& x, CDoubleVector& g);
virtual size_t do_size() const;
};
const char *minimizer_property = "CMinimizerMock";
BOOST_AUTO_TEST_CASE( test_load_minimizer_plugins )
{
set<string> test_data = { "gdsq", "gsl", "gdas"};
#ifdef HAVE_NLOPT
test_data.insert("nlopt");
#endif
compare_sets(CMinimizerPluginHandler::instance().get_set(), test_data);
}
BOOST_AUTO_TEST_CASE( test_missing_property_throws )
{
CMinimizer::PProblem problem(new CProblemMock);
CMinimizerMock minimizer;
minimizer.add(minimizer_property);
minimizer.set_problem(problem);
CDoubleVector x(problem->size());
BOOST_CHECK_THROW(minimizer.run(x), invalid_argument);
}
BOOST_AUTO_TEST_CASE( test_test_function_calls )
{
CMinimizer::PProblem problem(new CProblemMock);
CMinimizerMock minimizer;
minimizer.set_problem(problem);
CDoubleVector x(problem->size());
fill(x.begin(), x.end(), 10.0);
BOOST_REQUIRE(minimizer.run(x) == 0);
}
BOOST_AUTO_TEST_CASE( test_test_function_calls_2 )
{
CMinimizer::PProblem problem(new CProblemMock);
CMinimizerMock minimizer;
minimizer.set_problem(problem);
CDoubleVector x(problem->size());
fill(x.begin(), x.end(), 10.0);
CDoubleVector g(problem->size());
BOOST_CHECK_CLOSE(problem->f(x), 100.0, 0.0001);
BOOST_CHECK_CLOSE(problem->fdf(x, g), 100.0, 0.0001);
for (size_t i = 0; i < problem->size(); ++i) {
BOOST_CHECK_CLOSE(g[i], 2 * x[i], 0.0001);
}
problem->df(x, g);
for (size_t i = 0; i < problem->size(); ++i) {
BOOST_CHECK_CLOSE(g[i], 2 * x[i], 0.0001);
}
vector<double> vx(problem->size());
fill(vx.begin(), vx.end(), 10.0);
vector<double> vg(problem->size());
BOOST_CHECK_CLOSE(problem->f(vx), 100.0, 0.0001);
BOOST_CHECK_CLOSE(problem->fdf(vx, vg), 100.0, 0.0001);
for (size_t i = 0; i < problem->size(); ++i) {
BOOST_CHECK_CLOSE(vg[i], 2 * vx[i], 0.0001);
}
problem->df(vx, vg);
for (size_t i = 0; i < problem->size(); ++i) {
BOOST_CHECK_CLOSE(vg[i], 2 * vx[i], 0.0001);
}
}
int CMinimizerMock::do_run(CDoubleVector& x)
{
// this test minimization is only possible because the
// minimum is the only root
double f;
CDoubleVector g(get_problem().size());
int niter = 100;
do {
f = get_problem().fdf(x, g);
for (auto ix = x.begin(), ig = g.begin(); ix != x.end(); ++ix, ++ig) {
if (*ig != 0.0)
*ix -= f / *ig;
}
--niter;
cvdebug() << "[" << niter << "]: x = " << x[0] << ", f = " << f << "\n";
} while (f > 0.0001 && niter);
return niter > 0 ? 0 : -1;
}
double CProblemMock::do_f(const CDoubleVector& x)
{
return inner_product(x.begin(), x.end(), x.begin(), 0.0);
}
void CProblemMock::do_df(const CDoubleVector& x, CDoubleVector& g)
{
assert(x.size() == g.size());
transform(x.begin(), x.end(), g.begin(), [](double x) {
return 2 * x;
});
}
double CProblemMock::do_fdf(const CDoubleVector& x, CDoubleVector& g)
{
do_df(x, g);
return do_f(x);
}
size_t CProblemMock::do_size() const
{
return 1;
}
|
