| /dports/math/openturns/openturns-1.18/lib/src/Base/Optim/ |
| H A D | NearestPointProblem.cxx | 31 CLASSNAMEINIT(NearestPointProblem)
36 NearestPointProblem::NearestPointProblem() in NearestPointProblem() function in NearestPointProblem
44 NearestPointProblem::NearestPointProblem(const Function & levelFunction, in NearestPointProblem() function in NearestPointProblem
53 NearestPointProblem * NearestPointProblem::clone() const in clone()
55 return new NearestPointProblem(*this); in clone()
82 Bool NearestPointProblem::hasLevelFunction() const in hasLevelFunction()
88 Scalar NearestPointProblem::getLevelValue() const in getLevelValue()
109 void NearestPointProblem::clearLevelFunction() in clearLevelFunction()
121 String NearestPointProblem::__repr__() const in __repr__()
132 void NearestPointProblem::save(Advocate & adv) const in save()
[all …]
|
| /dports/math/openturns/openturns-1.18/python/src/ |
| H A D | NearestPointProblem.i | 9 %include openturns/NearestPointProblem.hxx
10 …mespace OT{ %extend NearestPointProblem { NearestPointProblem(const NearestPointProblem & other) {… in NearestPointProblem() function
|
| H A D | NearestPointProblem_doc.i.in | 1 %feature("docstring") OT::NearestPointProblem
31 >>> problem = ot.NearestPointProblem(levelFunction, 3.0)"
|
| H A D | optim_module.i | 54 %include NearestPointProblem.i
|
| H A D | Cobyla_doc.i.in | 31 >>> problem = ot.NearestPointProblem(model, 5.0)
|
| H A D | AbdoRackwitz_doc.i.in | 30 >>> problem = ot.NearestPointProblem(model, 5.0)
|
| H A D | SQP_doc.i.in | 36 >>> problem = ot.NearestPointProblem(model, -0.5)
|
| /dports/math/openturns/openturns-1.18/lib/src/Base/Optim/openturns/ |
| H A D | NearestPointProblem.hxx | 33 class OT_API NearestPointProblem class
42 NearestPointProblem();
45 NearestPointProblem(const Function & levelFunction,
49 NearestPointProblem * clone() const override;
|
| /dports/math/openturns/openturns-1.18/python/test/ |
| H A D | t_SQP_std.py | 20 algo = ot.SQP(ot.NearestPointProblem(levelFunction, 3.0))
39 algo = ot.SQP(ot.NearestPointProblem(levelFunction, -0.5))
|
| H A D | t_AbdoRackwitz_std.py | 18 algo = ot.AbdoRackwitz(ot.NearestPointProblem(levelFunction, 3.0))
34 algo = ot.AbdoRackwitz(ot.NearestPointProblem(levelFunction, -0.5))
|
| H A D | t_SQP_std.expout | 2 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
3 …aintError=0 problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
4 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
5 …or=1.02e-11 problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| H A D | t_Cobyla_std.py | 32 algo = ot.Cobyla(ot.NearestPointProblem(levelFunction, 3.0))
45 algo = ot.Cobyla(ot.NearestPointProblem(levelFunction, 3.0))
|
| H A D | t_AbdoRackwitz_std.expout | 2 …aintError=0 problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
4 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
5 …2.48235e-06 problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| /dports/math/openturns/openturns-1.18/lib/test/ |
| H A D | t_Cobyla_std.cxx | 56 Cobyla myAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
78 Cobyla myAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
|
| H A D | t_AbdoRackwitz_std.cxx | 61 AbdoRackwitz myAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
92 AbdoRackwitz myAlgorithm(NearestPointProblem(levelFunction, -0.5)); in main()
|
| H A D | t_SQP_std.cxx | 60 SQP mySQPAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
93 SQP mySQPAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
|
| H A D | t_Cobyla_std.expout | 1 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
4 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| H A D | t_SQP_std.expout | 1 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
4 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| H A D | t_AbdoRackwitz_std.expout | 1 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
5 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| H A D | t_FORM_SQP.cxx | 84 SQP myAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
|
| H A D | t_FORM_AbdoRackwitz.cxx | 84 AbdoRackwitz myAlgorithm(NearestPointProblem(levelFunction, 3.0)); in main()
|
| H A D | t_FORM_AbdoRackwitz.expout | 1 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| H A D | t_FORM_SQP.expout | 1 …lementation problem=class=OptimizationProblem implementation=class=NearestPointProblem level funct…
|
| /dports/math/openturns/openturns-1.18/python/doc/user_manual/ |
| H A D | optimization.rst | 19 NearestPointProblem
|
| /dports/math/openturns/openturns-1.18/lib/src/Uncertainty/Algorithm/Analytical/ |
| H A D | Analytical.cxx | 114 …nearestPointAlgorithm_.setProblem(NearestPointProblem(standardEvent.getImplementation()->getFuncti… in run()
|