1
0
mirror of https://github.com/aportelli/LatAnalyze.git synced 2024-11-14 01:45:35 +00:00
LatAnalyze/lib/MinuitMinimizer.cpp

206 lines
6.1 KiB
C++
Raw Normal View History

2014-02-20 20:21:45 +00:00
/*
* MinuitMinimizer.cpp, part of LatAnalyze 3
*
2015-06-11 14:04:54 +01:00
* Copyright (C) 2013 - 2015 Antonin Portelli
2014-02-20 20:21:45 +00:00
*
* LatAnalyze 3 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.
*
* LatAnalyze 3 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 LatAnalyze 3. If not, see <http://www.gnu.org/licenses/>.
*/
2014-03-13 18:51:01 +00:00
#include <LatAnalyze/MinuitMinimizer.hpp>
#include <LatAnalyze/includes.hpp>
2015-02-24 16:59:22 +00:00
#pragma GCC diagnostic ignored "-Wconversion"
2014-02-20 20:21:45 +00:00
#include <Minuit2/FCNBase.h>
#include <Minuit2/FunctionMinimum.h>
#include <Minuit2/MnMigrad.h>
#include <Minuit2/MnPrint.h>
#include <Minuit2/MnPlot.h>
#include <Minuit2/MnScan.h>
2014-09-18 17:18:51 +01:00
#include <Minuit2/MnSimplex.h>
2014-02-20 20:21:45 +00:00
#include <Minuit2/ScanMinimizer.h>
#include <Minuit2/SimplexMinimizer.h>
#include <Minuit2/VariableMetricMinimizer.h>
using namespace std;
using namespace ROOT;
using namespace Minuit2;
using namespace Latan;
static constexpr double initErr = 0.5;
2014-09-18 17:18:51 +01:00
static constexpr unsigned int maxTry = 10u;
2014-02-20 20:21:45 +00:00
/******************************************************************************
* MinuitMinimizer implementation *
******************************************************************************/
// MinuitFunction constructor //////////////////////////////////////////////////
MinuitMinimizer::MinuitFunction::MinuitFunction(const DoubleFunction &f)
: f_(&f)
{}
// MinuitFunction minuit members ///////////////////////////////////////////////
double MinuitMinimizer::MinuitFunction::operator()
(const vector<double> &x) const
{
return (*f_)(x);
2014-02-20 20:21:45 +00:00
}
double MinuitMinimizer::MinuitFunction::Up(void) const
{
return 1.;
}
// constructors ////////////////////////////////////////////////////////////////
MinuitMinimizer::MinuitMinimizer(const Algorithm algorithm)
{
setAlgorithm(algorithm);
}
MinuitMinimizer::MinuitMinimizer(const Index dim, const Algorithm algorithm)
2014-10-14 16:34:27 +01:00
: Minimizer(dim)
{
setAlgorithm(algorithm);
}
2014-10-14 16:34:27 +01:00
2014-09-22 15:19:30 +01:00
// access //////////////////////////////////////////////////////////////////////
MinuitMinimizer::Algorithm MinuitMinimizer::getAlgorithm(void) const
{
return algorithm_;
}
2014-09-22 15:19:30 +01:00
double MinuitMinimizer::getPrecision(void) const
{
LATAN_ERROR(Implementation,
"Minuit minimizer precision cannot be accessed");
return 0.;
}
void MinuitMinimizer::setAlgorithm(const Algorithm algorithm)
{
algorithm_ = algorithm;
}
void MinuitMinimizer::setPrecision(const double precision __dumb)
2014-09-22 15:19:30 +01:00
{
LATAN_ERROR(Implementation,
"Minuit minimizer precision cannot be accessed");
}
2014-02-20 20:21:45 +00:00
// minimization ////////////////////////////////////////////////////////////////
const DVec & MinuitMinimizer::operator()(const DoubleFunction &f)
{
DVec &x = getState();
Verbosity verbosity = getVerbosity();
if (f.getNArg() != x.size())
{
resize(f.getNArg());
2014-02-20 20:21:45 +00:00
}
// set parameters
2014-03-03 12:41:48 +00:00
MinuitFunction minuitF(f);
2014-02-20 20:21:45 +00:00
MnUserParameters parameters;
for (Index i = 0; i < x.size(); ++i)
2014-02-20 20:21:45 +00:00
{
2014-09-18 17:18:51 +01:00
parameters.Add("x_" + strFrom(i), x(i), initErr*fabs(x(i)));
if (hasLowLimit(i)&&hasHighLimit(i))
{
parameters.SetLimits(static_cast<unsigned int>(i),
getLowLimit(i), getHighLimit(i));
}
else if (hasLowLimit(i))
2014-10-14 16:34:27 +01:00
{
parameters.SetLowerLimit(static_cast<unsigned int>(i),
getLowLimit(i));
}
else if (hasHighLimit(i))
2014-10-14 16:34:27 +01:00
{
parameters.SetUpperLimit(static_cast<unsigned int>(i),
getHighLimit(i));
}
2014-02-20 20:21:45 +00:00
}
// pre-minimization
MnSimplex preMinimizer(minuitF, parameters, 1);
FunctionMinimum preMin = preMinimizer();
2014-02-20 20:21:45 +00:00
if (verbosity >= Verbosity::Debug)
{
cout << "-- MINUIT pre-minimization -----------------------------";
cout << preMin;
2014-02-20 20:21:45 +00:00
cout << "--------------------------------------------------------";
cout << endl;
}
for (unsigned int i = 0; i < x.size(); ++i)
{
parameters.SetValue(i, preMin.UserParameters().Value(i));
parameters.SetError(i, 2.*preMin.UserParameters().Error(i));
}
2014-02-20 20:21:45 +00:00
// minimization and output
unique_ptr<MnApplication> minimizer(nullptr);
if (algorithm_ == Algorithm::Migrad)
{
minimizer.reset(new MnMigrad(minuitF, parameters, 2));
}
else if (algorithm_ == Algorithm::Simplex)
{
minimizer.reset(new MnSimplex(minuitF, parameters, 2));
}
unsigned int iTry = 0;
FunctionMinimum min = (*minimizer)();
2014-09-18 17:18:51 +01:00
while ((!min.IsValid())&&(iTry < maxTry))
{
min = (*minimizer)();
2014-09-18 17:18:51 +01:00
iTry++;
}
if (!min.IsValid())
{
LATAN_WARNING("MINUIT library reported that minimization result is not valid");
}
2014-02-20 20:21:45 +00:00
for (unsigned int i = 0; i < x.size(); ++i)
{
x(i) = min.UserParameters().Value(i);
}
if (verbosity >= Verbosity::Normal)
{
cout << "-- MINUIT minimization ---------------------------------";
cout << min;
cout << "--------------------------------------------------------";
cout << endl;
}
if (verbosity >= Verbosity::Debug)
{
vector<pair<double, double>> scanRes;
MnPlot plot;
MnScan scanner(minuitF, preMin.UserParameters(), 2);
2014-02-20 20:21:45 +00:00
cout << "-- MINUIT scan -----------------------------------------";
cout << endl;
for (unsigned int i = 0; i < x.size(); i++)
{
cout << "Parameter x_" << i << endl;
scanRes = scanner.Scan(i);
plot(scanRes);
}
cout << "--------------------------------------------------------";
cout << endl;
}
return x;
}