| /dports/math/ipopt/Ipopt-3.12.13/Ipopt/src/Algorithm/Inexact/ |
| H A D | IpInexactDoglegNormal.cpp | 158 SmartPtr<Vector> inf_d = curr_d_minus_s->MakeNew(); in ComputeNormalStep() local
160 inf_d->AddTwoVectors(1., *curr_d_minus_s, -alpha_cs, *vec_AATc_d, 0.); in ComputeNormalStep()
161 Number c_Avc_norm_cauchy = IpCq().CalcNormOfType(NORM_2, *inf_c, *inf_d); in ComputeNormalStep()
268 inf_d = curr_d_minus_s->MakeNewCopy(); in ComputeNormalStep()
269 inf_d->AddTwoVectors(-ftb_cauchy, *v_cauchy_s_bak, in ComputeNormalStep()
271 …().CalcNormOfType(NORM_2, *curr_c, *curr_d_minus_s)-IpCq().CalcNormOfType(NORM_2, *inf_c, *inf_d)); in ComputeNormalStep()
281 inf_d = curr_d_minus_s->MakeNewCopy(); in ComputeNormalStep()
282 inf_d->AddTwoVectors(-ftb_dogleg, *normal_s, in ComputeNormalStep()
284 …().CalcNormOfType(NORM_2, *curr_c, *curr_d_minus_s)-IpCq().CalcNormOfType(NORM_2, *inf_c, *inf_d)); in ComputeNormalStep()
|
| H A D | IpInexactNormalTerminationTester.cpp | 131 SmartPtr<Vector> inf_d = curr_d_minus_s->MakeNew(); in TestTermination() local
132 inf_d->AddTwoVectors(1., *curr_d_minus_s, 1., *sol_s, 0.); in TestTermination()
133 IpCq().curr_jac_d()->MultVector(-1., *sol_x, 1., *inf_d); in TestTermination()
135 Number trial_c_Av_norm = IpCq().CalcNormOfType(NORM_2, *inf_c, *inf_d); in TestTermination()
|
| /dports/devel/ppl/ppl-1.2/src/ |
| H A D | Partially_Reduced_Product_templates.hh | 285 Coefficient& inf_d, in minimize() argument
309 inf_d = inf2_d; in minimize()
316 inf_d = inf1_d; in minimize()
323 inf_d = inf1_d; in minimize()
328 inf_d = inf2_d; in minimize()
400 Coefficient& inf_d, in minimize() argument
427 inf_d = inf2_d; in minimize()
435 inf_d = inf1_d; in minimize()
443 inf_d = inf1_d; in minimize()
449 inf_d = inf2_d; in minimize()
|
| H A D | Grid_inlines.hh | 346 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const { in minimize() argument
347 return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum); in minimize()
352 Coefficient& inf_n, Coefficient& inf_d, bool& minimum, in minimize() argument
354 return max_min(expr, "minimize(e, ...)", inf_n, inf_d, minimum, &point); in minimize()
|
| H A D | Polyhedron_inlines.hh | 340 Coefficient& inf_n, Coefficient& inf_d, in minimize() argument
343 return max_min(expr, false, inf_n, inf_d, minimum, g); in minimize()
348 Coefficient& inf_n, Coefficient& inf_d, bool& minimum, in minimize() argument
350 return max_min(expr, false, inf_n, inf_d, minimum, g); in minimize()
|
| H A D | Box_inlines.hh | 218 Coefficient& inf_n, Coefficient& inf_d, in minimize() argument
220 return max_min(expr, false, inf_n, inf_d, minimum); in minimize()
226 Coefficient& inf_n, Coefficient& inf_d, bool& minimum, in minimize() argument
228 return max_min(expr, false, inf_n, inf_d, minimum, g); in minimize()
|
| H A D | BD_Shape_inlines.hh | 413 Coefficient& inf_n, Coefficient& inf_d, in minimize() argument
415 return max_min(expr, false, inf_n, inf_d, minimum); in minimize()
421 Coefficient& inf_n, Coefficient& inf_d, bool& minimum, in minimize() argument
423 return max_min(expr, false, inf_n, inf_d, minimum, g); in minimize()
|
| H A D | Octagonal_Shape_inlines.hh | 304 Coefficient& inf_n, Coefficient& inf_d, in minimize() argument
306 return max_min(expr, false, inf_n, inf_d, minimum); in minimize()
312 Coefficient& inf_n, Coefficient& inf_d, in minimize() argument
315 return max_min(expr, false, inf_n, inf_d, minimum, g); in minimize()
|
| H A D | Pointset_Powerset_defs.hh | 427 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
459 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Partially_Reduced_Product_defs.hh | 864 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
895 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Grid_defs.hh | 830 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
864 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Polyhedron_defs.hh | 730 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
761 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Box_defs.hh | 657 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
688 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Octagonal_Shape_defs.hh | 819 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
850 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | BD_Shape_defs.hh | 728 Coefficient& inf_n, Coefficient& inf_d, bool& minimum) const;
759 Coefficient& inf_n, Coefficient& inf_d, bool& minimum,
|
| H A D | Pointset_Powerset_templates.hh | 1066 Coefficient& inf_d, in minimize() argument
1116 inf_d = best_inf_d; in minimize()
1125 Coefficient& inf_d, in minimize() argument
1182 inf_d = best_inf_d; in minimize()
|
| /dports/devel/ppl/ppl-1.2/interfaces/Java/parma_polyhedra_library/ |
| H A D | Fake_Class_for_Doxygen.java | 176 Coefficient inf_n, Coefficient inf_d, in minimize() argument
241 Coefficient inf_n, Coefficient inf_d, in minimize() argument
|
| /dports/lang/v8/v8-9.6.180.12/test/cctest/ |
| H A D | test-macro-assembler-riscv64.cc | 55 const double inf_d = std::numeric_limits<double>::infinity(); variable
57 const double minf_d = -inf_d;
638 inf_d, minf_d, inf_d, qnan_d, 3.0, in TEST()
639 inf_d, qnan_d, qnan_d}; in TEST()
640 double inputsb[kTableLength] = {3.0, 2.0, 0.0, -0.0, inf_d, in TEST()
641 42.0, inf_d, minf_d, 3.0, qnan_d, in TEST()
642 qnan_d, inf_d, qnan_d}; in TEST()
646 double outputsdmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, inf_d, in TEST()
647 inf_d, inf_d, inf_d, qnan_d, qnan_d, in TEST()
|
| H A D | test-assembler-mips.cc | 9848 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
9863 {inf_d, 9.22e18, qnan_d, -9.22e18, 0, 0}, in TEST()
9864 {inf_d, inf_d, -inf_d, inf_d, 0, 0}, in TEST()
9865 {-2.3e-308, 5e-324, -inf_d, inf_d, 0, 0}, in TEST()
10008 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
10021 {0.3, -2.14e103, -inf_d, std::sqrt(8.e-206), -1e30, 4.6e102}, in TEST()
10022 {inf_d, 0., -23.e304, -2.104e9, 0, 2.104e9}, in TEST()
10095 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
10107 {0.3, -2.14e103, -inf_d, -std::sqrt(8e206), 0, 0}, in TEST()
10108 {inf_d, -0., -23e304, -2.14e90, 0, 0}, in TEST()
[all …]
|
| H A D | test-assembler-mips64.cc | 10761 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
10776 {inf_d, 9.22e18, qnan_d, -9.22e18, 0, 0}, in TEST()
10777 {inf_d, inf_d, -inf_d, inf_d, 0, 0}, in TEST()
10778 {-2.3e-308, 5e-324, -inf_d, inf_d, 0, 0}, in TEST()
10922 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
10935 {0.3, -2.14e103, -inf_d, std::sqrt(8.e-206), -1e30, 4.6e102}, in TEST()
10936 {inf_d, 0., -23.e304, -2.104e9, 0, 2.104e9}, in TEST()
11009 const double inf_d = std::numeric_limits<double>::infinity(); in TEST() local
11021 {0.3, -2.14e103, -inf_d, -std::sqrt(8e206), 0, 0}, in TEST()
11022 {inf_d, -0., -23e304, -2.14e90, 0, 0}, in TEST()
[all …]
|
| /dports/devel/ppl/ppl-1.2/tests/Grid/ |
| H A D | maxmin1.cc | 57 Coefficient inf_n, inf_d; in check_minimize() local
59 bool ok = (gr.minimize(le, inf_n, inf_d, dummy, inf_pnt) in check_minimize()
61 && inf_d == expected_d in check_minimize()
|
| /dports/math/py-cdecimal/cdecimal-2.3/python/ |
| H A D | test_cdecimal2.5.py | 1187 inf_d = Decimal('Infinity')
1210 assert_attr(inf_d, inf_f, '__eq__', c, None)
1218 assert_attr(inf_d, neg_inf_f, '__ne__', c, None)
|
| H A D | test_cdecimal3.py | 1783 inf_d = Decimal('Infinity')
1806 assert_attr(inf_d, inf_f, '__eq__', c, None)
1814 assert_attr(inf_d, neg_inf_f, '__ne__', c, None)
|
| H A D | test_cdecimal2.py | 1799 inf_d = Decimal('Infinity')
1822 assert_attr(inf_d, inf_f, '__eq__', c, None)
1830 assert_attr(inf_d, neg_inf_f, '__ne__', c, None)
|
| /dports/devel/ppl/ppl-1.2/interfaces/C/ |
| H A D | C_interface.dox | 522 \param inf_d
542 ppl_Coefficient_t inf_d,
555 ppl_Coefficient_t inf_d,
|