/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/dcp2cone/ |
H A D | dcp2cone.py | 29 def __init__(self, problem=None): argument 33 def accepts(self, problem): argument 38 def apply(self, problem): argument
|
/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/eliminate_pwl/ |
H A D | eliminate_pwl.py | 26 def __init__(self, problem=None) -> None: argument 30 def accepts(self, problem) -> bool: argument 35 def apply(self, problem): argument
|
/dports/java/springframework31/spring-framework-3.1.4.RELEASE/projects/org.springframework.beans/src/main/java/org/springframework/beans/factory/parsing/ |
H A D | FailFastProblemReporter.java | 58 public void fatal(Problem problem) { in fatal() 67 public void error(Problem problem) { in error() 75 public void warning(Problem problem) { in warning()
|
/dports/science/siconos/siconos-4.4.0/numerics/src/VI/ |
H A D | VariationalInequality_box_newton_QiLSA.c | 31 VariationalInequality* problem = (VariationalInequality*) data_opaque; in VI_compute_F() local 37 VariationalInequality* problem = (VariationalInequality*) data_opaque; in VI_compute_error_box() local 43 VariationalInequality* problem = (VariationalInequality*) data_opaque; in VI_compute_F_box_Qi() local 49 VariationalInequality* problem = (VariationalInequality*) data_opaque; in VI_compute_H_box_Qi() local 57 void variationalInequality_box_newton_QiLSA(VariationalInequality* problem, double *x, double *F, i… in variationalInequality_box_newton_QiLSA()
|
/dports/devel/py-yamllint/yamllint-1.26.3/yamllint/ |
H A D | cli.py | 55 def parsable(problem, filename): argument 64 def standard(problem, filename): argument 75 def standard_color(problem, filename): argument 89 def github(problem, filename): argument
|
/dports/science/siconos/siconos-4.4.0/numerics/src/Relay/ |
H A D | RelayProblem.c | 72 int relay_printInFile(RelayProblem* problem, FILE* file) in relay_printInFile() 115 RelayProblem* problem = relayProblem_new(); in relay_newFromFile() local 146 RelayProblem* problem = NULL; in relay_new_from_filename() local 159 void freeRelay_problem(RelayProblem* problem) in freeRelay_problem()
|
/dports/science/siconos/siconos-4.4.0/numerics/src/MLCP/ |
H A D | mlcp_path_enum.c | 44 int mlcp_path_enum_getNbIWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_path_enum_getNbIWork() 48 int mlcp_path_enum_getNbDWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_path_enum_getNbDWork() 54 void mlcp_path_enum_init(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_path_enum_init() 76 void mlcp_path_enum(MixedLinearComplementarityProblem* problem, double *z, double *w, int *info, So… in mlcp_path_enum()
|
H A D | mlcp_direct.c | 115 int mlcp_direct_getNbIWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_getNbIWork() 121 int mlcp_direct_getNbDWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_getNbDWork() 128 void mlcp_direct_init(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_init() 177 int internalPrecompute(MixedLinearComplementarityProblem* problem) in internalPrecompute() 208 int internalAddConfig(MixedLinearComplementarityProblem* problem, int * zw, int init) in internalAddConfig() 231 void mlcp_direct_addConfig(MixedLinearComplementarityProblem* problem, int * zw) in mlcp_direct_addConfig() 270 void mlcp_direct_addConfigFromWSolution(MixedLinearComplementarityProblem* problem, double * wSol) in mlcp_direct_addConfigFromWSolution() 286 int solveWithCurConfig(MixedLinearComplementarityProblem* problem) in solveWithCurConfig() 342 void mlcp_direct(MixedLinearComplementarityProblem* problem, double *z, double *w, int *info, Solve… in mlcp_direct()
|
H A D | mlcp_direct_FB.c | 44 int mlcp_direct_FB_getNbIWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_FB_getNbIWork() 49 int mlcp_direct_FB_getNbDWork(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_FB_getNbDWork() 56 void mlcp_direct_FB_init(MixedLinearComplementarityProblem* problem, SolverOptions* options) in mlcp_direct_FB_init() 83 void mlcp_direct_FB(MixedLinearComplementarityProblem* problem, double *z, double *w, int *info, So… in mlcp_direct_FB()
|
/dports/science/siconos/siconos-4.4.0/kernel/src/simulationTools/test/ |
H A D | OSNSPTest.cpp | 35 SP::FrictionContact problem = std::make_shared<FrictionContact>(); in testOSNSBuild_default() local 45 SP::FrictionContact problem = std::make_shared<FrictionContact>(3, SICONOS_FRICTION_3D_ADMM); in testOSNSBuild_solverid() local 56 SP::FrictionContact problem = std::make_shared<FrictionContact>(3, options); in testOSNSBuild_options() local
|
/dports/math/osqp/osqp-0.6.2/tests/primal_dual_infeasibility/ |
H A D | test_primal_dual_infeasibility.h | 15 OSQPData *problem; // Problem data in test_optimal() local 85 OSQPData *problem; // Problem data in test_prim_infeas() local 139 OSQPData *problem; // Problem data in test_dual_infeas() local 193 OSQPData *problem; // Problem data in test_primal_dual_infeas() local
|
/dports/security/nmap/nmap-7.91/liblinear/ |
H A D | linear.h | 14 struct problem struct 16 int l, n; 17 int *y; 18 struct feature_node **x; 19 double bias; /* < 0 if no bias term */
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.pde.ui/apitools/org.eclipse.pde.api.tools.tests/src/org/eclipse/pde/api/tools/problems/tests/ |
H A D | ApiFilterTests.java | 39 …IApiProblem problem = ApiProblemFactory.newApiBaselineProblem("", null, null, IElementDescriptor.R… in testToString() local 49 …IApiProblem problem = ApiProblemFactory.newApiBaselineProblem("path", new String[] {"one"}, new St… in testEquals() local 69 …IApiProblem problem = ApiProblemFactory.newApiBaselineProblem("path", new String[] {"one"}, new St… in testClone() local
|
/dports/math/casadi/casadi-3.5.5/docs/users_guide/source/ |
H A D | ocp.rst | 48 Direct single-shooting 75 Direct multiple-shooting 91 Direct collocation
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/modules/SamplingAlgorithms/python/ |
H A D | KernelWrapper.cpp | 24 ….def_static("Construct", [](py::dict d, std::shared_ptr<AbstractSamplingProblem> problem)->std::sh… in KernelWrapper() 33 ….def(py::init( [](py::dict d, std::shared_ptr<AbstractSamplingProblem> problem) {return new MHKern… in KernelWrapper() 34 ….def(py::init( [](py::dict d, std::shared_ptr<AbstractSamplingProblem> problem, std::shared_ptr<MC… in KernelWrapper()
|
/dports/science/siconos/siconos-4.4.0/numerics/src/FrictionContact/ |
H A D | gfc3d_solvers_wr.c | 40 void gfc3d_nsgs_wr(GlobalFrictionContactProblem* problem, double *reaction, double *velocity, doub… in gfc3d_nsgs_wr() 84 void gfc3d_admm_wr(GlobalFrictionContactProblem* problem, double *reaction, double *velocity, doub… in gfc3d_admm_wr() 114 void gfc3d_nonsmooth_Newton_AlartCurnier_wr(GlobalFrictionContactProblem* problem, double *reactio… in gfc3d_nonsmooth_Newton_AlartCurnier_wr() 147 void gfc3d_nsgs_velocity_wr(GlobalFrictionContactProblem* problem, double *reaction, double *veloc… in gfc3d_nsgs_velocity_wr() 175 void gfc3d_proximal_wr(GlobalFrictionContactProblem* problem, double *reaction, double *velocity, … in gfc3d_proximal_wr() 204 void gfc3d_DeSaxceFixedPoint_wr(GlobalFrictionContactProblem* problem, double *reaction, double *v… in gfc3d_DeSaxceFixedPoint_wr() 232 void gfc3d_TrescaFixedPoint_wr(GlobalFrictionContactProblem* problem, double *reaction, double *ve… in gfc3d_TrescaFixedPoint_wr()
|
H A D | fc3d_nonsmooth_Newton_AlartCurnier2.c | 44 FrictionContactProblem* problem; member 55 FrictionContactProblem* problem = ((FC3D_Newton_data*) data_opaque)->problem; in FC3D_compute_F() local 64 FrictionContactProblem* problem = dat->problem; in FC3D_compute_error() local 72 FrictionContactProblem* problem = dat->problem; in FC3D_compute_F_merit() local 83 FrictionContactProblem* problem = dat->problem; in FC3D_compute_AWpB() local 95 FrictionContactProblem* problem, in fc3d_nonsmooth_Newton_AlartCurnier2()
|
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/ |
H A D | boolean_problem.cc | 52 void ExtractAssignment(const LinearBooleanProblem& problem, in ExtractAssignment() 221 bool LoadBooleanProblem(const LinearBooleanProblem& problem, in LoadBooleanProblem() 261 bool LoadAndConsumeBooleanProblem(LinearBooleanProblem* problem, in LoadAndConsumeBooleanProblem() 362 bool IsAssignmentValid(const LinearBooleanProblem& problem, in IsAssignmentValid() 393 const LinearBooleanProblem& problem) { in LinearBooleanProblemToCnfString() 488 void ExtractSubproblem(const LinearBooleanProblem& problem, in ExtractSubproblem() 535 const LinearBooleanProblem& problem, in GenerateGraphForSymmetryDetection() 637 void MakeAllLiteralsPositive(LinearBooleanProblem* problem) { in MakeAllLiteralsPositive() 673 const LinearBooleanProblem& problem, in FindLinearBooleanProblemSymmetries() 746 LinearBooleanProblem* problem) { in ApplyLiteralMappingToBooleanProblem() [all …]
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
H A D | gradient_problem_test.cc | 69 ceres::GradientProblem problem(new QuadraticTestFunction(&is_destructed)); in TEST() local 75 ceres::GradientProblem problem(new QuadraticTestFunction()); in TEST() local 83 ceres::GradientProblem problem(new QuadraticTestFunction(), in TEST() local 92 ceres::GradientProblem problem(new QuadraticTestFunction()); in TEST() local 101 ceres::GradientProblem problem(new QuadraticTestFunction(), in TEST() local
|
H A D | line_search_preprocessor_test.cc | 43 ProblemImpl problem; in TEST() local 52 ProblemImpl problem; in TEST() local 63 ProblemImpl problem; in TEST() local 85 ProblemImpl problem; in TEST() local 97 ProblemImpl problem; in TEST() local 118 ProblemImpl problem; in TEST() local
|
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/ |
H A D | gradient_problem_test.cc | 68 { ceres::GradientProblem problem(new QuadraticTestFunction(&is_destructed)); } in TEST() local 73 ceres::GradientProblem problem(new QuadraticTestFunction()); in TEST() local 81 ceres::GradientProblem problem(new QuadraticTestFunction(), in TEST() local 90 ceres::GradientProblem problem(new QuadraticTestFunction()); in TEST() local 99 ceres::GradientProblem problem(new QuadraticTestFunction(), in TEST() local
|
H A D | line_search_preprocessor_test.cc | 44 ProblemImpl problem; in TEST() local 53 ProblemImpl problem; in TEST() local 64 ProblemImpl problem; in TEST() local 86 ProblemImpl problem; in TEST() local 98 ProblemImpl problem; in TEST() local 120 ProblemImpl problem; in TEST() local
|
/dports/math/py-cvxpy/cvxpy-1.1.17/cvxpy/reductions/solvers/qp_solvers/ |
H A D | qp_solver.py | 42 def accepts(self, problem): argument 50 def _prepare_data_and_inv_data(self, problem): argument 64 def apply(self, problem): argument
|
/dports/math/octave-forge-nan/nan-3.6.1/src/ |
H A D | linear.h | 56 struct problem struct 58 int l, n; 59 double *y; 60 struct feature_node **x; 61 double bias; /* < 0 if no bias term */
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform/ant/org.eclipse.ant.ui/Ant Editor/org/eclipse/ant/internal/ui/editor/text/ |
H A D | AntExternalAnnotationModel.java | 34 public void acceptProblem(IProblem problem) { in acceptProblem() 54 IProblem problem = e.next(); in endReporting() local 80 protected Position createPositionFromProblem(IProblem problem) { in createPositionFromProblem()
|