| /external/ceres-solver/internal/ceres/ |
| dynamic_compressed_row_finalizer.h | 41 void operator()(SparseMatrix* base_jacobian, int num_parameters) {
44 jacobian->Finalize(num_parameters);
|
| line_search_direction.h | 45 : num_parameters(0),
53 int num_parameters; member in struct:ceres::internal::LineSearchDirection::Options
|
| levenberg_marquardt_strategy.cc | 74 const int num_parameters = jacobian->num_cols(); local
76 if (diagonal_.rows() != num_parameters) {
77 diagonal_.resize(num_parameters, 1);
81 for (int i = 0; i < num_parameters; ++i) {
101 InvalidateArray(num_parameters, step);
112 !IsArrayValid(num_parameters, step)) {
116 VectorRef(step, num_parameters) *= -1.0;
|
| line_search_minimizer.h | 49 State(int num_parameters,
|
| low_rank_inverse_hessian.cc | 76 int num_parameters,
79 : num_parameters_(num_parameters),
83 delta_x_history_(num_parameters, max_num_corrections),
84 delta_gradient_history_(num_parameters, max_num_corrections),
|
| program_evaluator.h | 104 void operator()(SparseMatrix* jacobian, int num_parameters) {}
256 const int num_parameters = program_->NumEffectiveParameters(); local
261 VectorRef(gradient, num_parameters).setZero();
266 VectorRef(gradient, num_parameters) +=
267 VectorRef(evaluate_scratch_[i].gradient.get(), num_parameters);
272 // `num_parameters` is passed to the finalizer so that additional
277 f(jacobian, num_parameters);
314 int num_parameters) {
317 gradient.reset(new double[num_parameters]);
318 VectorRef(gradient.get(), num_parameters).setZero()
355 int num_parameters = program.NumEffectiveParameters(); local
[all...] |
| cost_function_to_functor_test.cc | 52 int num_parameters = 0; local
55 num_parameters += parameter_block_sizes[i];
58 scoped_array<double> parameters(new double[num_parameters]);
59 for (int i = 0; i < num_parameters; ++i) {
64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]);
68 (new double[num_parameters * num_residuals]);
77 num_parameters = 0;
79 parameter_blocks[i] = parameters.get() + num_parameters;
80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals;
82 actual_jacobians.get() + num_parameters * num_residuals
[all...] |
| low_rank_inverse_hessian.h | 64 // num_parameters is the row/column size of the Hessian.
71 // 2 * max_num_corrections * num_parameters + max_num_corrections
73 LowRankInverseHessian(int num_parameters,
|
| line_search_direction.cc | 101 LBFGS(const int num_parameters,
104 : low_rank_inverse_hessian_(num_parameters,
147 BFGS(const int num_parameters,
149 : num_parameters_(num_parameters),
161 inverse_hessian_ = Matrix::Identity(num_parameters, num_parameters);
263 // Efficient O(num_parameters^2) BFGS update [2].
356 options.num_parameters,
363 options.num_parameters,
|
| summary_utils.cc | 51 summary->num_parameters = program.NumParameters();
|
| line_search_minimizer.cc | 107 const int num_parameters = evaluator->NumParameters(); local
114 VectorRef x(parameters, num_parameters);
116 State current_state(num_parameters, num_effective_parameters);
117 State previous_state(num_parameters, num_effective_parameters);
120 Vector x_plus_delta(num_parameters);
166 line_search_direction_options.num_parameters = num_effective_parameters;
|
| program.cc | 445 int num_parameters = 0; local
447 num_parameters += parameter_blocks_[i]->Size();
449 return num_parameters;
453 int num_parameters = 0; local
455 num_parameters += parameter_blocks_[i]->LocalSize();
457 return num_parameters;
476 int num_parameters = residual_block->NumParameterBlocks(); local
477 for (int j = 0; j < num_parameters; ++j) {
|
| residual_block.cc | 204 int num_parameters = NumParameterBlocks(); local
206 for (int i = 0; i < num_parameters; ++i) {
|
| /external/chromium_org/content/browser/android/java/ |
| gin_java_bound_object_delegate.cc | 29 size_t num_parameters) {
30 return object_->FindMethod(method_name, num_parameters);
|
| gin_java_bound_object_delegate.h | 25 size_t num_parameters) OVERRIDE;
|
| java_method.h | 26 size_t num_parameters() const;
|
| gin_java_bound_object.cc | 94 size_t num_parameters) {
109 if (iter->second->num_parameters() == num_parameters) {
|
| gin_java_bound_object.h | 59 size_t num_parameters);
|
| gin_java_method_invocation_helper_unittest.cc | 34 size_t num_parameters) OVERRIDE {
188 size_t num_parameters) OVERRIDE {
242 size_t num_parameters) OVERRIDE {
288 size_t num_parameters) OVERRIDE {
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_function_inlining.cpp | 103 int num_parameters; local
109 num_parameters = 0;
111 num_parameters++;
113 parameters = new ir_variable *[num_parameters];
121 for (i = 0; i < num_parameters; i++) {
177 for (i = 0; i < num_parameters; i++) {
200 for (i = 0; i < num_parameters; i++) {
|
| /external/mesa3d/src/glsl/ |
| opt_function_inlining.cpp | 103 int num_parameters; local
109 num_parameters = 0;
111 num_parameters++;
113 parameters = new ir_variable *[num_parameters];
121 for (i = 0; i < num_parameters; i++) {
177 for (i = 0; i < num_parameters; i++) {
200 for (i = 0; i < num_parameters; i++) {
|
| /external/ceres-solver/examples/ |
| bal_problem.h | 72 int num_parameters() const { return num_parameters_; } function in class:ceres::examples::BALProblem
|
| nist.cc | 238 int num_parameters() const { return initial_parameters_.cols(); } function in class:ceres::examples::NISTProblem
406 template <typename Model, int num_residuals, int num_parameters>
411 CHECK_EQ(num_parameters, nist_problem.num_parameters());
428 new ceres::AutoDiffCostFunction<Model, num_residuals, num_parameters>(
443 for (int i = 0; i < num_parameters; ++i) {
|
| more_garbow_hillstrom.cc | 65 #define BEGIN_MGH_PROBLEM(name, num_parameters, num_residuals) \
67 static const int kNumParameters = num_parameters; \
76 num_parameters>(new name); \
|
| /external/ceres-solver/include/ceres/ |
| dynamic_autodiff_cost_function.h | 118 const int num_parameters = std::accumulate(parameter_block_sizes().begin(), local
123 vector<Jet<double, Stride> > input_jets(num_parameters);
|
