Home
last modified time | relevance | path

Searched refs:lower_bounds (Results 1 – 25 of 692) sorted by relevance

12345678910>>...28

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/unit_test/
H A Ddakota_hdf5_dist_params.in23 lower_bounds -4.0 -3.9
26 lower_bounds -3 -2
42 lower_bounds -0.7 -inf
47 lower_bounds 1e-3 0.1
50 lower_bounds -2.0 -1.5
53 lower_bounds 0.5 1e-4
57 lower_bounds 0.1 0.2
65 # lower_bounds 0.0 0.1
119 lower_bounds 1 2 3 4 5
137 lower_bounds -0.6 -0.5
[all …]
/dports/misc/opennn/opennn-5.0.5/opennn/
H A Dbounding_layer.cpp96 return lower_bounds.dimension(0); in get_inputs_number()
104 return lower_bounds.dimension(0); in get_neurons_number()
112 return lower_bounds; in get_lower_bounds()
140 return lower_bounds[i]; in get_lower_bound()
195 lower_bounds.resize(0); in set()
219 lower_bounds.resize(new_inputs_number); in set_inputs_number()
253 lower_bounds = other_bounding_layer.lower_bounds; in set()
320 lower_bounds = new_lower_bounds; in set_lower_bounds()
356 lower_bounds[index] = new_lower_bound; in set_lower_bound()
508 if(inputs(i,j) < lower_bounds(j)) outputs(i,j) = lower_bounds(j); in calculate_outputs()
[all …]
/dports/science/dftbplus/dftbplus-19.1/tools/dptools/src/dptools/
H A Dgrids.py48 self.lower_bounds = self.ranges[:, 0]
50 self.shape = self.upper_bounds - self.lower_bounds
163 lower_bounds = subgrid.lower_bounds + suborig_int
165 contained = np.all(lower_bounds >= self.lower_bounds)
169 return np.transpose([lower_bounds, upper_bounds])
187 lower_bounds = np.max([self.lower_bounds, other_lower_bounds], axis=0)
189 lower_bounds = np.floor(lower_bounds).astype(int)
191 gridranges = np.vstack((lower_bounds, upper_bounds)).transpose()
223 is_inside = np.logical_and(self.lower_bounds <= gridcoords,
262 relative_ranges = subgrid_ranges - self.grid.lower_bounds[:, np.newaxis]
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/DDACE/src/Sampling/
H A DDDaceCentralCompositeSampler.cpp71 std::vector<double> lower_bounds(nInputs_); in getSamples() local
74 lower_bounds[i] = dist_[i].lowerBound(); in getSamples()
81 x[k] = 0.5*(lower_bounds[k]+upper_bounds[k]); in getSamples()
88 x[j] = 0.5*(lower_bounds[j]+upper_bounds[j]); in getSamples()
89 x[i] = lower_bounds[i]; in getSamples()
101 stepSize[j] = upper_bounds[j]-lower_bounds[j]; in getSamples()
109 fullFactorialPoints(currentIndex, nInputs_, lower_bounds, upper_bounds, in getSamples()
116 int numVars, const std::vector<double>& lower_bounds, in fullFactorialPoints() argument
128 x[currentIndex] = lower_bounds[currentIndex] + in fullFactorialPoints()
132 fullFactorialPoints(nextIndex, numVars, lower_bounds, upper_bounds, in fullFactorialPoints()
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/lib/gitlab/pagination/keyset/
H A Dpage.rb17 def initialize(order_by: {}, lower_bounds: nil, per_page: DEFAULT_PAGE_SIZE)
19 @lower_bounds = lower_bounds&.symbolize_keys
32 def next(lower_bounds) argument
34 next_page.lower_bounds = lower_bounds&.symbolize_keys
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/test/
H A Ddakota_pstudy_allvars.in20 lower_bounds = 10. #s0,#s1,#s4
23 lower_bounds = -3 #s0,#s1
36 lower_bounds = 200. #s0,#s2
39 lower_bounds = 0.1 #s0,#s2,#s4
43 lower_bounds = -2. #s0,#s2
50 lower_bounds = -2. #s0,#s2
87 lower_bounds = 2. 4. #s0,#s3
91 lower_bounds = 2 4 #s0,#s3
102 lower_bounds = 10. #s0,#s1
105 lower_bounds = -3 #s0,#s1
H A Ddakota_sampling_doptimal.in34 # lower_bounds = 10.
40 # lower_bounds = -3
59 lower_bounds = 200. #s0,#s2
62 lower_bounds = 0.1 #s0,#s2
66 lower_bounds = -2. #s0,#s2
73 lower_bounds = -2. #s0,#s2
118 # lower_bounds = 2. 4.
123 # lower_bounds = 2 4
137 # lower_bounds = 10.
143 # lower_bounds = -3
H A Ddakota_sbouu3_tbch.in35 lower_bounds 1.5 0.0
99 # lower_bounds = 211.7, 504.2
103 lower_bounds = 199.3, 474.63
109 # lower_bounds = 225., 540.
146 # lower_bounds = 211.7, 504.2
150 lower_bounds = 199.3, 474.63
156 # lower_bounds = 225., 540.
H A Ddakota_var_views_dace.in43 lower_bounds -2. -2.
47 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6
49 # lower_bounds -2. -2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
55 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6
57 # lower_bounds -2. -2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
62 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6
65 # lower_bounds -2. -2. #s7,#s8,#s9,#s10,#s11,#s12,#s13
H A Ddakota_sbouu4_tbch.in33 lower_bounds 1.5 0.0
125 # lower_bounds = 211.7, 504.2
129 lower_bounds = 199.3, 474.63
135 # lower_bounds = 225., 540.
172 # lower_bounds = 211.7, 504.2
176 lower_bounds = 199.3, 474.63
182 # lower_bounds = 225., 540.
H A Ddakota_trsbouu4_tbch.in43 lower_bounds 1.5 0.0
138 # lower_bounds = 211.7, 504.2
141 lower_bounds = 199.3, 474.63
146 # lower_bounds = 225., 540.
181 # lower_bounds = 211.7, 504.2
184 lower_bounds = 199.3, 474.63
189 # lower_bounds = 225., 540.
H A Ddakota_var_views_opt.in37 lower_bounds -2. -2.
42 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
43 # lower_bounds -2. -2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
49 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
50 # lower_bounds -2. -2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
57 lower_bounds -1. -1. #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8
58 # lower_bounds -2. -2. #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s17
H A Ddakota_coliny.in129 lower_bounds -10.0 -10.0 -10.0 #s0,#s1,#s2,#s3
130 # lower_bounds -10.0 -10.0 -10.0 #s6,#s7,#s8,#s9
131 # lower_bounds -10.0 -10.0 -10.0 #s14,#s15,#s16,#s17,#s21
132 # lower_bounds -10.0 -10.0 -10.0 #s22,#s23,#s24,#s25
133 # lower_bounds -10.0 -10.0 -10.0 #s26,#s27,#s28,#s29
134 # lower_bounds 0.0 0.0 0.0 #s4,#s5,#s12,#s13,#s18,#s19
135 # lower_bounds 0.0 0.0 0.0 #s30,#s31,#s32,#s33,#s34,#s35
136 # lower_bounds -2.0 -2.0 -2.0 #s20
142 # lower_bounds 1 1 #s22,#s23,#s24,#s25,#s26
143 # lower_bounds 1 1 #s27,#s28,#s29,#s30,#s31
H A Ddakota_rol.in21 lower_bounds 0.5 -2.9 #s0
25 # lower_bounds 50*-0.5 #s16
30 # lower_bounds 7*0. #s1
38 # lower_bounds -2.0 -2.0 #s2,#s3
46 # lower_bounds 5*-2.0 #s4,#s5,#s6,#s7,#s8,#s9,#s10,#s11,#s12,#s13,#s14,#s15
54 # lower_bounds 2*0.0 #s17,#s18
62 # lower_bounds 1.5 0.0 #s19,#s20,#s21,#s22
70 # lower_bounds 2*1.0 #s23,#s24,#s29,#s30
98 lower_bounds -inf -inf #s0
H A Ddakota_uq_rosenbrock_verify.in18 # lower_bounds = -2. -2. #s1
27 # lower_bounds = -2. -2. #s3
39 # lower_bounds = -2. #s5
48 # lower_bounds = -2. #s5
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DPEBBLBranching.cpp71 lower_bounds.resize(subModel.continuous_lower_bounds().length()); in setRootComputation()
76 lower_bounds[i] = subModel.continuous_lower_bounds()[i]; in setRootComputation()
88 subModel.continuous_lower_bounds(lower_bounds); in boundComputation()
176 temp->pebbldSubAsChildOf(this, splitVar, whichChild, candidate_x, lower_bounds, upper_bounds); in makeChild()
199 lower_bounds.resize(subModel.continuous_lower_bounds().length()); in pebbldSubAsChildOf()
204 lower_bounds[i] = _lower_bounds[i]; in pebbldSubAsChildOf()
218 lower_bounds[_splitVar] = ceil(cont_vars[_splitVar]); in pebbldSubAsChildOf()
219 if(cont_vars[_splitVar]<lower_bounds[_splitVar]) in pebbldSubAsChildOf()
220 cont_vars[_splitVar] = lower_bounds[_splitVar]; in pebbldSubAsChildOf()
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/examples/
H A Dmore_garbow_hillstrom.cc165 const double TestProblem3::lower_bounds[] = {0.0, 1.0}; member in ceres::examples::TestProblem3
180 const double TestProblem4::lower_bounds[] = {0.0, 0.00003}; member in ceres::examples::TestProblem4
195 const double TestProblem5::lower_bounds[] = {0.6, 0.5}; member in ceres::examples::TestProblem5
254 const double TestProblem8::lower_bounds[] = { member in ceres::examples::TestProblem8
278 const double TestProblem9::lower_bounds[] = {0.398, 1.0, -0.5}; member in ceres::examples::TestProblem9
299 const double TestProblem10::lower_bounds[] = { member in ceres::examples::TestProblem10
341 const double TestProblem12::lower_bounds[] = {0.0, 5.0, 0.0}; member in ceres::examples::TestProblem12
360 const double TestProblem13::lower_bounds[] = { member in ceres::examples::TestProblem13
408 const double TestProblem15::lower_bounds[] = { member in ceres::examples::TestProblem15
456 const double TestProblem17::lower_bounds[] = { member in ceres::examples::TestProblem17
[all …]
/dports/math/ceres-solver/ceres-solver-2.0.0/examples/
H A Dmore_garbow_hillstrom.cc168 const double TestProblem3::lower_bounds[] = {0.0, 1.0}; member in ceres::examples::TestProblem3
183 const double TestProblem4::lower_bounds[] = {0.0, 0.00003}; member in ceres::examples::TestProblem4
198 const double TestProblem5::lower_bounds[] = {0.6, 0.5}; member in ceres::examples::TestProblem5
257 const double TestProblem8::lower_bounds[] = { member in ceres::examples::TestProblem8
281 const double TestProblem9::lower_bounds[] = {0.398, 1.0, -0.5}; member in ceres::examples::TestProblem9
302 const double TestProblem10::lower_bounds[] = { member in ceres::examples::TestProblem10
344 const double TestProblem12::lower_bounds[] = {0.0, 5.0, 0.0}; member in ceres::examples::TestProblem12
363 const double TestProblem13::lower_bounds[] = { member in ceres::examples::TestProblem13
411 const double TestProblem15::lower_bounds[] = { member in ceres::examples::TestProblem15
459 const double TestProblem17::lower_bounds[] = { member in ceres::examples::TestProblem17
[all …]
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/spec/lib/gitlab/pagination/keyset/
H A Dpage_spec.rb33 …let(:page) { described_class.new(order_by: order_by, lower_bounds: lower_bounds, per_page: per_pag…
55 expect(subject.lower_bounds).to eq(new_lower_bounds)
56 expect(page.lower_bounds).to eq(lower_bounds)
H A Dpager_spec.rb47 lower_bounds = records.last.slice(:id)
48 expect(page).to receive(:next).with(lower_bounds).and_return(next_page)
58 lower_bounds = records.last.slice(:id)
59 expect(page).to receive(:next).with(lower_bounds).and_return(next_page)
/dports/math/py-or-tools/or-tools-9.2/ortools/glop/
H A Dvariable_values.cc40 const DenseRow& lower_bounds = variables_info_.GetVariableLowerBounds(); in SetNonBasicVariableValueFromStatus() local
45 DCHECK_NE(-kInfinity, lower_bounds[col]); in SetNonBasicVariableValueFromStatus()
46 DCHECK_EQ(lower_bounds[col], upper_bounds[col]); in SetNonBasicVariableValueFromStatus()
47 variable_values_[col] = lower_bounds[col]; in SetNonBasicVariableValueFromStatus()
50 DCHECK_NE(-kInfinity, lower_bounds[col]); in SetNonBasicVariableValueFromStatus()
51 variable_values_[col] = lower_bounds[col]; in SetNonBasicVariableValueFromStatus()
72 const DenseRow& lower_bounds = variables_info_.GetVariableLowerBounds(); in ResetAllNonBasicVariableValues() local
82 variable_values_[col] = lower_bounds[col]; in ResetAllNonBasicVariableValues()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/inactive/
H A DLocalRefinableDriver.cpp22 initialize_grid(const RealArray& lower_bounds,const RealArray& upper_bounds, in initialize_grid() argument
36 if ( lower_bounds.size() != upper_bounds.size() ) { in initialize_grid()
38 << " Got lower_bounds.size() == " << lower_bounds.size() in initialize_grid()
44 numVars = lower_bounds.size(); in initialize_grid()
46 bounds[0] = lower_bounds; in initialize_grid()
51 if ( lower_bounds[i] >= upper_bounds[i] ) { in initialize_grid()
53 << " Got lower_bounds[" << i << "] = " << lower_bounds[i] in initialize_grid()
59 midpoint[i] = lower_bounds[i] + (upper_bounds[i] - lower_bounds[i]) / 2.0; in initialize_grid()
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/
H A D_k_means_elkan.pyx37 floating[:, ::1] lower_bounds): # OUT argument
88 lower_bounds[i, 0] = min_dist
93 lower_bounds[i, j] = dist
167 lower_bounds[i, 0] = min_dist
174 lower_bounds[i, j] = dist
300 lower_bounds[start: end],
330 if lower_bounds[i, j] < 0:
331 lower_bounds[i, j] = 0
534 lower_bounds[start: end],
565 if lower_bounds[i, j] < 0:
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/surfpack/src/
H A DConmin.cpp17 void Conmin::bounds(const VecDbl& lower_bounds, const VecDbl& upper_bounds) in bounds() argument
19 assert(upper_bounds.size() == lower_bounds.size()); in bounds()
21 lowerBounds = lower_bounds; in bounds()
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/arith/
H A Dsolve_linear_inequality.cc226 auto lb = lower_bounds->find(*ub); in MoveEquality()
227 if (lb != lower_bounds->end()) { in MoveEquality()
229 lower_bounds->erase(lb); in MoveEquality()
327 lower_bounds.reserve(coef_neg.size()); in SolveLinearInequalities()
354 if (std::any_of(lower_bounds.begin(), lower_bounds.end(), in SolveLinearInequalities()
361 for (auto iter = lower_bounds.begin(); iter != lower_bounds.end();) { in SolveLinearInequalities()
363 iter = lower_bounds.erase(iter); in SolveLinearInequalities()
369 lower_bounds.insert(bound); in SolveLinearInequalities()
373 equal.reserve(std::min(upper_bounds.size(), lower_bounds.size())); in SolveLinearInequalities()
374 MoveEquality(&upper_bounds, &lower_bounds, &equal); in SolveLinearInequalities()
[all …]

12345678910>>...28