Searched refs:n_iterations_ (Results 1 – 11 of 11) sorted by relevance
/dports/math/adept/adept-2.0.8/adept/ |
H A D | minimize_levenberg_marquardt.cpp | 27 n_iterations_ = 0; in minimize_levenberg_marquardt() 48 if (n_iterations_ == 0) { in minimize_levenberg_marquardt() 65 optimizable.report_progress(n_iterations_, x, cost_function_, gradient_norm_); in minimize_levenberg_marquardt() 134 n_iterations_++; in minimize_levenberg_marquardt() 142 if (n_iterations_ >= max_iterations_) { in minimize_levenberg_marquardt() 192 n_iterations_ = 0; in minimize_levenberg_marquardt_bounded() 230 if (n_iterations_ == 0) { in minimize_levenberg_marquardt_bounded() 295 optimizable.report_progress(n_iterations_, x, cost_function_, gradient_norm_); in minimize_levenberg_marquardt_bounded() 415 n_iterations_++; in minimize_levenberg_marquardt_bounded() 427 if (n_iterations_ >= max_iterations_) { in minimize_levenberg_marquardt_bounded()
|
/dports/science/mpqc/mpqc-2.3.1/src/lib/math/optimize/ |
H A D | opt.cc | 67 n_iterations_ = 0; in Optimize() 86 n_iterations_ = 0; in Optimize() 130 n_iterations_ = 0; in init() 170 while((n_iterations_ < max_iterations_) && (!(result = update()))) { in optimize() 171 ++n_iterations_; in optimize()
|
H A D | qnewton.cc | 236 if( n_iterations_ == 0 && force_search_ ) in update() 243 if( n_iterations_ == 0 && force_search_ ) in update() 382 << n_iterations_ + 1 << " complete" << endl; in update()
|
H A D | opt.h | 50 int n_iterations_; variable
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/examples/model_selection/ |
H A D | plot_successive_halving_iterations.py | 61 for i in range(rsh.n_iterations_) 64 ax.set_xticks(range(rsh.n_iterations_))
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/segmentation/include/pcl/segmentation/ |
H A D | crf_segmentation.h | 92 setNumberOfIterations (unsigned int n_iterations = 10) {n_iterations_ = n_iterations;}; 197 unsigned int n_iterations_; variable
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/model_selection/tests/ |
H A D | test_successive_halving.py | 110 assert sh.n_iterations_ == expected_n_iterations 173 assert sh.n_iterations_ == expected_n_iterations 178 assert sh.n_possible_iterations_ == sh.n_iterations_ == len(sh.n_resources_) 219 assert sh.n_iterations_ == n_iterations 536 n_iter = sh.n_iterations_
|
/dports/math/adept/adept-2.0.8/include/adept/ |
H A D | Minimizer.h | 137 int n_iterations() const { return n_iterations_; } in n_iterations() 187 int n_iterations_; variable
|
/dports/math/adept/adept-2.0.8/include/ |
H A D | adept_source.h | 2496 n_iterations_ = 0; in minimize_levenberg_marquardt() 2517 if (n_iterations_ == 0) { in minimize_levenberg_marquardt() 2534 optimizable.report_progress(n_iterations_, x, cost_function_, gradient_norm_); in minimize_levenberg_marquardt() 2603 n_iterations_++; in minimize_levenberg_marquardt() 2611 if (n_iterations_ >= max_iterations_) { in minimize_levenberg_marquardt() 2661 n_iterations_ = 0; in minimize_levenberg_marquardt_bounded() 2699 if (n_iterations_ == 0) { in minimize_levenberg_marquardt_bounded() 2764 optimizable.report_progress(n_iterations_, x, cost_function_, gradient_norm_); in minimize_levenberg_marquardt_bounded() 2884 n_iterations_++; in minimize_levenberg_marquardt_bounded() 2896 if (n_iterations_ >= max_iterations_) { in minimize_levenberg_marquardt_bounded()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/segmentation/include/pcl/segmentation/impl/ |
H A D | crf_segmentation.hpp | 527 crf.mapInference (n_iterations_, r); in segmentPoints()
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/model_selection/ |
H A D | _search_successive_halving.py | 377 self.n_iterations_ = n_iterations
|