1
// Ceres Solver - A fast non-linear least squares minimizer
2
// Copyright 2010, 2011, 2012 Google Inc. All rights reserved.
3
// http://code.google.com/p/ceres-solver/
5
// Redistribution and use in source and binary forms, with or without
6
// modification, are permitted provided that the following conditions are met:
8
// * Redistributions of source code must retain the above copyright notice,
9
// this list of conditions and the following disclaimer.
10
// * Redistributions in binary form must reproduce the above copyright notice,
11
// this list of conditions and the following disclaimer in the documentation
12
// and/or other materials provided with the distribution.
13
// * Neither the name of Google Inc. nor the names of its contributors may be
14
// used to endorse or promote products derived from this software without
15
// specific prior written permission.
17
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27
// POSSIBILITY OF SUCH DAMAGE.
29
// Author: keir@google.com (Keir Mierle)
31
// A simple example of using the Ceres minimizer.
33
// Minimize 0.5 (10 - x)^2 using analytic jacobian matrix.
37
#include "ceres/ceres.h"
39
using ceres::SizedCostFunction;
44
class SimpleCostFunction
45
: public SizedCostFunction<1 /* number of residuals */,
46
1 /* size of first parameter */> {
48
virtual ~SimpleCostFunction() {}
49
virtual bool Evaluate(double const* const* parameters,
51
double** jacobians) const {
52
double x = parameters[0][0];
55
residuals[0] = 10 - x;
57
// f'(x) = -1. Since there's only 1 parameter and that parameter
58
// has 1 dimension, there is only 1 element to fill in the
60
if (jacobians != NULL && jacobians[0] != NULL) {
67
int main(int argc, char** argv) {
68
google::ParseCommandLineFlags(&argc, &argv, true);
69
google::InitGoogleLogging(argv[0]);
71
// The variable with its initial value that we will be solving for.
76
// Set up the only cost function (also known as residual).
77
problem.AddResidualBlock(new SimpleCostFunction, NULL, &x);
80
Solver::Options options;
81
options.max_num_iterations = 10;
82
options.linear_solver_type = ceres::DENSE_QR;
83
options.minimizer_progress_to_stdout = true;
84
Solver::Summary summary;
85
Solve(options, &problem, &summary);
86
std::cout << summary.BriefReport() << "\n";
87
std::cout << "x : 5.0 -> " << x << "\n";