| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/ |
| H A D | compressed_sensing.hpp | 145 int max_num_iterations,
162 int max_num_iterations,
209 int max_num_iterations,
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/graph/ |
| H A D | cliques.h | 185 BronKerboschAlgorithmStatus RunIterations(int64_t max_num_iterations);
194 BronKerboschAlgorithmStatus RunWithTimeLimit(int64_t max_num_iterations,
512 int64_t max_num_iterations, TimeLimit* time_limit) { in RunWithTimeLimit() argument
518 for (num_remaining_iterations_ = max_num_iterations; in RunWithTimeLimit()
550 int64_t max_num_iterations) { in RunIterations() argument
552 return RunWithTimeLimit(max_num_iterations, &time_limit); in RunIterations()
|
| /dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/ |
| H A D | minimizer.h | 67 max_num_iterations = options.max_num_iterations; in Init()
118 int max_num_iterations; member
|
| H A D | iterative_refiner.cc | 41 IterativeRefiner::IterativeRefiner(const int max_num_iterations) in IterativeRefiner() argument
42 : max_num_iterations_(max_num_iterations) {} in IterativeRefiner()
|
| H A D | line_search.cc | 292 CHECK_GT(options().max_num_iterations, 0); in DoSearch()
325 if (summary->num_iterations >= options().max_num_iterations) { in DoSearch()
330 options().max_num_iterations); in DoSearch()
608 } else if (summary->num_iterations >= options().max_num_iterations) { in BracketingPhase()
616 "max_num_iterations: %d", options().max_num_iterations); in BracketingPhase()
765 if (summary->num_iterations >= options().max_num_iterations) { in ZoomPhase()
771 options().max_num_iterations, num_bracketing_iterations); in ZoomPhase()
|
| H A D | iterative_schur_complement_solver.cc | 100 cg_options.max_num_iterations = options_.max_num_iterations; in SolveImpl()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
| H A D | minimizer.h | 66 max_num_iterations = options.max_num_iterations; in Init()
117 int max_num_iterations; member
|
| H A D | line_search.cc | 281 CHECK_GT(options().max_num_iterations, 0); in DoSearch()
314 if (summary->num_iterations >= options().max_num_iterations) { in DoSearch()
319 options().max_num_iterations); in DoSearch()
597 } else if (summary->num_iterations >= options().max_num_iterations) { in BracketingPhase()
605 "max_num_iterations: %d", options().max_num_iterations); in BracketingPhase()
739 if (summary->num_iterations >= options().max_num_iterations) { in ZoomPhase()
745 options().max_num_iterations, num_bracketing_iterations); in ZoomPhase()
|
| H A D | conjugate_gradients_solver_test.cc | 61 options.max_num_iterations = 10; in TEST()
118 options.max_num_iterations = 10; in TEST()
|
| H A D | linear_solver.h | 114 max_num_iterations(1), in Options()
136 int max_num_iterations; member
|
| H A D | line_search.h | 70 max_num_iterations(20), in Options()
119 int max_num_iterations; member
|
| H A D | iterative_schur_complement_solver.cc | 100 cg_options.max_num_iterations = options_.max_num_iterations; in SolveImpl()
|
| /dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/ |
| H A D | minimizer.h | 64 max_num_iterations = options.max_num_iterations; in Init()
113 int max_num_iterations; member
|
| H A D | iterative_refiner.cc | 42 IterativeRefiner::IterativeRefiner(const int max_num_iterations) in IterativeRefiner() argument
43 : max_num_iterations_(max_num_iterations) {} in IterativeRefiner()
|
| H A D | line_search.cc | 290 CHECK_GT(options().max_num_iterations, 0); in DoSearch()
321 if (summary->num_iterations >= options().max_num_iterations) { in DoSearch()
326 options().max_num_iterations); in DoSearch()
605 } else if (summary->num_iterations >= options().max_num_iterations) { in BracketingPhase()
614 options().max_num_iterations); in BracketingPhase()
767 if (summary->num_iterations >= options().max_num_iterations) { in ZoomPhase()
773 options().max_num_iterations, in ZoomPhase()
|
| H A D | conjugate_gradients_solver_test.cc | 63 options.max_num_iterations = 10; in TEST()
119 options.max_num_iterations = 10; in TEST()
|
| H A D | iterative_schur_complement_solver.cc | 99 cg_options.max_num_iterations = options_.max_num_iterations; in SolveImpl()
|
| /dports/misc/openmvg/openMVG-2.0/src/openMVG/numeric/ |
| H A D | l1_solver_admm.hpp | 77 int max_num_iterations = 1000; member
105 options_.max_num_iterations = max_iterations; in SetMaxIterations()
146 for (int i = 0; i < options_.max_num_iterations; ++i) in Solve()
|
| /dports/graphics/colmap/colmap-3.6/src/estimators/ |
| H A D | pose.h | 86 int max_num_iterations = 100; member
102 CHECK_GE(max_num_iterations, 0); in Check()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/include/ceres/ |
| H A D | gradient_problem_solver.h | 73 max_num_iterations = 50; in Options()
222 int max_num_iterations; member
|
| H A D | solver.h | 81 max_num_iterations = 50; in Options()
340 int max_num_iterations; member
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/examples/ |
| H A D | libmv_homography.cc | 86 : max_num_iterations(50), in EstimateHomographyOptions()
90 int max_num_iterations; member
355 solver_options.max_num_iterations = options.max_num_iterations; in EstimateHomography2DFromCorrespondences()
|
| /dports/math/ceres-solver/ceres-solver-2.0.0/examples/ |
| H A D | libmv_homography.cc | 86 : max_num_iterations(50), expected_average_symmetric_distance(1e-16) {} in EstimateHomographyOptions()
89 int max_num_iterations; member
345 solver_options.max_num_iterations = options.max_num_iterations; in EstimateHomography2DFromCorrespondences()
|
| /dports/graphics/colmap/colmap-3.6/src/optim/ |
| H A D | least_absolute_deviations.cc | 54 CHECK_GT(options.max_num_iterations, 0); in SolveLeastAbsoluteDeviations()
74 for (int i = 0; i < options.max_num_iterations; ++i) { in SolveLeastAbsoluteDeviations()
|
| H A D | least_absolute_deviations.h | 50 int max_num_iterations = 1000; member
|