Searched refs:new_cost (Results 1 – 5 of 5) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | trust_region_minimizer.cc | 395 double new_cost = std::numeric_limits<double>::max(); in Minimize() local
398 &new_cost, in Minimize()
404 new_cost = numeric_limits<double>::max(); in Minimize()
411 if (new_cost < std::numeric_limits<double>::max()) { in Minimize()
416 const double x_plus_delta_cost = new_cost; in Minimize()
423 &new_cost, in Minimize()
426 new_cost = x_plus_delta_cost; in Minimize()
431 model_cost_change += x_plus_delta_cost - new_cost; in Minimize()
435 << " Inner iteration cost: " << new_cost; in Minimize()
437 inner_iterations_were_useful = new_cost < cost; in Minimize()
[all …]
|
| /external/valgrind/callgrind/ |
| D | events.c | 359 Bool CLG_(add_diff_cost)(EventSet* es, ULong* dst, ULong* old, ULong* new_cost) in CLG_()
365 CLG_ASSERT(old && new_cost); in CLG_()
368 if (new_cost[i] == old[i]) continue; in CLG_()
369 dst[i] += new_cost[i] - old[i]; in CLG_()
370 old[i] = new_cost[i]; in CLG_()
377 Bool CLG_(add_diff_cost_lz)(EventSet* es, ULong** pdst, ULong* old, ULong* new_cost) in CLG_()
384 CLG_ASSERT(old && new_cost); in CLG_()
393 if (new_cost[i] == old[i]) continue; in CLG_()
394 dst[i] += new_cost[i] - old[i]; in CLG_()
395 old[i] = new_cost[i]; in CLG_()
|
| D | events.h | 102 Bool CLG_(add_diff_cost)(EventSet*,ULong* dst, ULong* old, ULong* new_cost);
103 Bool CLG_(add_diff_cost_lz)(EventSet*,ULong** pdst, ULong* old, ULong* new_cost);
|
| /external/webp/src/enc/ |
| D | frame.c | 159 const int new_cost = BranchCost(nb, total, new_p) in FinalizeTokenProbas() local
162 const int use_new_p = (old_cost > new_cost); in FinalizeTokenProbas()
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| D | frame.c | 196 const int new_cost = BranchCost(nb, total, new_p) in FinalizeTokenProbas() local
199 const int use_new_p = (old_cost > new_cost); in FinalizeTokenProbas()
|