Searched defs:step_size (Results 1 - 11 of 11) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | line_search_minimizer.h | 56 step_size(0.0) { 65 double step_size; member in struct:ceres::internal::LineSearchMinimizer::State
|
H A D | line_search.cc | 147 // Returns step_size \in [min_step_size, max_step_size] which minimizes the 213 double step_size = 0.0, unused_min_value = 0.0; local 215 &step_size, &unused_min_value); 216 return step_size; 233 // Note initial_cost & initial_gradient are evaluated at step_size = 0, 282 const double step_size = local 291 if (step_size * descent_direction_max_norm < options().min_step_size) { 293 StringPrintf("Line search failed: step_size too small: %.5e " 294 "with descent_direction_max_norm: %.5e.", step_size, 301 current.x = step_size; 597 const double step_size = local [all...] |
/external/ceres-solver/include/ceres/internal/ |
H A D | numeric_diff.h | 122 ParameterVector step_size = x.array().abs() * relative_step_size; local 125 // the mean step_size for the other dimensions. If all the 129 (step_size.sum() == 0) 131 : step_size.sum() / step_size.rows(); 139 (step_size(j) == 0.0) ? fallback_step_size : step_size(j);
|
/external/ceres-solver/include/ceres/ |
H A D | iteration_callback.h | 57 step_size(0.0), 129 double step_size; member in struct:ceres::IterationSummary
|
H A D | dynamic_numeric_diff_cost_function.h | 174 ParameterVector step_size = x.array().abs() * relative_step_size; local 177 // the mean step_size for the other dimensions. 178 double fallback_step_size = step_size.sum() / step_size.rows(); 181 // relative step_size as absolute step_size and hope for the best. 188 if (step_size(j) == 0.0) { 190 // mean step_size from the other parameters. This can break in 193 step_size(j) = fallback_step_size; 195 x_plus_delta(j) = x(j) + step_size( [all...] |
/external/chromium_org/content/browser/renderer_host/p2p/ |
H A D | socket_host_tcp_unittest.cc | 156 size_t step_size = std::min(step_sizes[step], received_data.size() - pos); local 157 socket_->AppendInputData(&received_data[pos], step_size); 158 pos += step_size; 339 size_t step_size = std::min(step_sizes[step], received_data.size() - pos); local 340 socket_->AppendInputData(&received_data[pos], step_size); 341 pos += step_size;
|
/external/chromium_org/chrome/app/ |
H A D | image_pre_reader_win.cc | 329 size_t step_size) { 348 const DWORD actual_step_size = std::max(static_cast<DWORD>(step_size), 370 // size as the stride, ignoring the passed in step_size, to make sure 327 PreReadImage(const wchar_t* file_path, size_t size_to_read, size_t step_size) argument
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | filter.c | 234 const int step_size = (delta_max - delta_min >= 4) ? 4 : 1; local 249 for (d = delta_min; d <= delta_max; d += step_size) {
|
/external/webp/src/enc/ |
H A D | filter.c | 234 const int step_size = (delta_max - delta_min >= 4) ? 4 : 1; local 249 for (d = delta_min; d <= delta_max; d += step_size) {
|
/external/speex/libspeex/ |
H A D | jitter.c | 272 EXPORT JitterBuffer *jitter_buffer_init(int step_size) argument 281 jitter->delay_step = step_size; 282 jitter->concealment_size = step_size;
|
/external/chromium_org/v8/src/ |
H A D | heap.cc | 4237 void Heap::AdvanceIdleIncrementalMarking(intptr_t step_size) { argument 4238 incremental_marking()->Step(step_size, 4271 intptr_t step_size = local 4283 AdvanceIdleIncrementalMarking(step_size); 4332 AdvanceIdleIncrementalMarking(step_size);
|
Completed in 527 milliseconds