blob: fe99767587d5b8b5fbd732ac55063fb4fd4e1d15 [file] [log] [blame]
Austin Schuh70cc9552019-01-21 19:46:48 -08001// Ceres Solver - A fast non-linear least squares minimizer
Austin Schuh3de38b02024-06-25 18:25:10 -07002// Copyright 2023 Google Inc. All rights reserved.
Austin Schuh70cc9552019-01-21 19:46:48 -08003// http://ceres-solver.org/
4//
5// Redistribution and use in source and binary forms, with or without
6// modification, are permitted provided that the following conditions are met:
7//
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.
16//
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.
28//
29// Author: sameeragarwal@google.com (Sameer Agarwal)
30
31#ifndef CERES_INTERNAL_GRADIENT_PROBLEM_EVALUATOR_H_
32#define CERES_INTERNAL_GRADIENT_PROBLEM_EVALUATOR_H_
33
34#include <map>
Austin Schuh3de38b02024-06-25 18:25:10 -070035#include <memory>
Austin Schuh70cc9552019-01-21 19:46:48 -080036#include <string>
37
38#include "ceres/evaluator.h"
39#include "ceres/execution_summary.h"
40#include "ceres/gradient_problem.h"
Austin Schuh3de38b02024-06-25 18:25:10 -070041#include "ceres/internal/disable_warnings.h"
42#include "ceres/internal/export.h"
43#include "ceres/sparse_matrix.h"
Austin Schuh70cc9552019-01-21 19:46:48 -080044#include "ceres/wall_time.h"
45
Austin Schuh3de38b02024-06-25 18:25:10 -070046namespace ceres::internal {
Austin Schuh70cc9552019-01-21 19:46:48 -080047
Austin Schuh3de38b02024-06-25 18:25:10 -070048class CERES_NO_EXPORT GradientProblemEvaluator final : public Evaluator {
Austin Schuh70cc9552019-01-21 19:46:48 -080049 public:
50 explicit GradientProblemEvaluator(const GradientProblem& problem)
51 : problem_(problem) {}
Austin Schuh3de38b02024-06-25 18:25:10 -070052
53 std::unique_ptr<SparseMatrix> CreateJacobian() const final { return nullptr; }
54
55 bool Evaluate(const EvaluateOptions& /*evaluate_options*/,
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080056 const double* state,
57 double* cost,
Austin Schuh3de38b02024-06-25 18:25:10 -070058 double* /*residuals*/,
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080059 double* gradient,
60 SparseMatrix* jacobian) final {
Austin Schuh3de38b02024-06-25 18:25:10 -070061 CHECK(jacobian == nullptr);
Austin Schuh70cc9552019-01-21 19:46:48 -080062 ScopedExecutionTimer total_timer("Evaluator::Total", &execution_summary_);
63 // The reason we use Residual and Jacobian here even when we are
64 // only computing the cost and gradient has to do with the fact
65 // that the line search minimizer code is used by both the
66 // GradientProblemSolver and the main CeresSolver coder where the
67 // Evaluator evaluates the Jacobian, and these magic strings need
68 // to be consistent across the code base for the time accounting
69 // to work.
70 ScopedExecutionTimer call_type_timer(
Austin Schuh3de38b02024-06-25 18:25:10 -070071 gradient == nullptr ? "Evaluator::Residual" : "Evaluator::Jacobian",
Austin Schuh70cc9552019-01-21 19:46:48 -080072 &execution_summary_);
73 return problem_.Evaluate(state, cost, gradient);
74 }
75
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080076 bool Plus(const double* state,
77 const double* delta,
78 double* state_plus_delta) const final {
Austin Schuh70cc9552019-01-21 19:46:48 -080079 return problem_.Plus(state, delta, state_plus_delta);
80 }
81
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080082 int NumParameters() const final { return problem_.NumParameters(); }
Austin Schuh70cc9552019-01-21 19:46:48 -080083
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080084 int NumEffectiveParameters() const final {
Austin Schuh3de38b02024-06-25 18:25:10 -070085 return problem_.NumTangentParameters();
Austin Schuh70cc9552019-01-21 19:46:48 -080086 }
87
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080088 int NumResiduals() const final { return 1; }
Austin Schuh70cc9552019-01-21 19:46:48 -080089
Austin Schuh1d1e6ea2020-12-23 21:56:30 -080090 std::map<std::string, internal::CallStatistics> Statistics() const final {
Austin Schuh70cc9552019-01-21 19:46:48 -080091 return execution_summary_.statistics();
92 }
93
94 private:
95 const GradientProblem& problem_;
96 ::ceres::internal::ExecutionSummary execution_summary_;
97};
98
Austin Schuh3de38b02024-06-25 18:25:10 -070099} // namespace ceres::internal
100
101#include "ceres/internal/reenable_warnings.h"
Austin Schuh70cc9552019-01-21 19:46:48 -0800102
103#endif // CERES_INTERNAL_GRADIENT_PROBLEM_EVALUATOR_H_