Searched refs:max_linesearch (Results 1 – 14 of 14) sorted by relevance
/dports/science/openbabel/openbabel-3.1.1/include/LBFGS/ |
H A D | Param.h | 129 int max_linesearch; variable 170 max_linesearch = 20; in LBFGSParam() 197 if(max_linesearch <= 0) in check_param()
|
H A D | LineSearchBacktracking.h | 66 for(iter = 0; iter < param.max_linesearch; iter++) in LineSearch() 100 if(iter >= param.max_linesearch) in LineSearch()
|
H A D | LineSearchBracketing.h | 65 for( int iter = 0; iter < param.max_linesearch; iter++ ) in LineSearch() 101 if(iter >= param.max_linesearch) in LineSearch()
|
H A D | LineSearchNocedalWright.h | 96 if(iter++ >= param.max_linesearch) in LineSearch() 152 if(iter++ >= param.max_linesearch) in LineSearch()
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/Optimizersv4/src/ |
H A D | itkLBFGS2Optimizerv4.cxx | 64 << m_Pimpl->m_Parameters.max_linesearch << std::endl; in PrintSelf() 435 m_Pimpl->m_Parameters.max_linesearch = n; in SetMaximumLineSearchEvaluations() 441 return m_Pimpl->m_Parameters.max_linesearch; in GetMaximumLineSearchEvaluations()
|
/dports/math/igraph/igraph-0.9.5/vendor/plfit/ |
H A D | lbfgs.h | 262 int max_linesearch; member
|
H A D | lbfgs.c | 334 if (param.max_linesearch <= 0) { in lbfgs() 735 if (param->max_linesearch <= count) { in line_search_backtracking() 809 if (param->max_linesearch <= count) { in line_search_backtracking_owlqn() 899 …if ((brackt && ((*stp <= stmin || stmax <= *stp) || param->max_linesearch <= count + 1 || uinfo !=… in line_search_morethuente() 934 if (param->max_linesearch <= count) { in line_search_morethuente()
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/libLBFGS/include/ |
H A D | lbfgs.h | 265 int max_linesearch; member
|
/dports/math/R-cran-igraph/igraph/src/plfit/ |
H A D | lbfgs.h | 262 int max_linesearch; member
|
H A D | lbfgs.c | 334 if (param.max_linesearch <= 0) { in lbfgs() 734 if (param->max_linesearch <= count) { in line_search_backtracking() 808 if (param->max_linesearch <= count) { in line_search_backtracking_owlqn() 898 …if ((brackt && ((*stp <= stmin || stmax <= *stp) || param->max_linesearch <= count + 1 || uinfo !=… in line_search_morethuente() 933 if (param->max_linesearch <= count) { in line_search_morethuente()
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/libLBFGS/src/ |
H A D | lbfgs.c | 327 if (param.max_linesearch <= 0) { in lbfgs() 727 if (param->max_linesearch <= count) { in line_search_backtracking() 801 if (param->max_linesearch <= count) { in line_search_backtracking_owlqn() 891 …if ((brackt && ((*stp <= stmin || stmax <= *stp) || param->max_linesearch <= count + 1 || uinfo !=… in line_search_morethuente() 926 if (param->max_linesearch <= count) { in line_search_morethuente()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Revoropt/include/Revoropt/Solver/ |
H A D | lbfgs.hpp | 58 solver_param.max_linesearch = 20 ; in LBFGS()
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | qs_scf.F | 1386 max_linesearch, max_scf, nspins, & local 1466 max_linesearch = scf_control%outer_scf%cdft_opt_control%max_ls 1488 … " Evaluating optimal step size for optimizer using a maximum of", max_linesearch, " steps" 1502 DO i = 1, max_linesearch 1577 IF (i == max_linesearch) continue_ls_exit = .TRUE. 1609 (i == max_linesearch .AND. converged .AND. .NOT. found_solution)) THEN
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | qs_scf.F | 1352 max_linesearch, max_scf, nspins, & local 1432 max_linesearch = scf_control%outer_scf%cdft_opt_control%max_ls 1454 … " Evaluating optimal step size for optimizer using a maximum of", max_linesearch, " steps" 1468 DO i = 1, max_linesearch 1543 IF (i == max_linesearch) continue_ls_exit = .TRUE. 1575 (i == max_linesearch .AND. converged .AND. .NOT. found_solution)) THEN
|