/dports/math/py-or-tools/or-tools-9.2/examples/tests/ |
H A D | min_max_test.cc | 95 std::unique_ptr<Solver> solver_; member in operations_research::MinArrayCtTest 117 solver_->Solve(solver_->RevAlloc(new MinArrayCtTestSetToMin(min_, vars_))); in TestSetToMin() 122 solver_->Solve(solver_->RevAlloc(new MinArrayCtTestSetToMax(min_, vars_))); in TestSetToMax() 127 solver_->Solve(solver_->RevAlloc(new MinArrayCtTestSetOneVar(min_, vars_))); in TestSetOneVar() 168 expr = solver_->MakeMin(vars); in TestSmallMinVector() 172 expr = solver_->MakeMin(vars); in TestSmallMinVector() 176 expr = solver_->MakeMin(vars); in TestSmallMinVector() 189 expr = solver_->MakeMin(vars); in TestSmallMinArray() 292 solver_->Solve(solver_->RevAlloc(new MaxArrayCtTestSetToMin(max_, vars_))); in TestSetToMin() 297 solver_->Solve(solver_->RevAlloc(new MaxArrayCtTestSetToMax(max_, vars_))); in TestSetToMax() [all …]
|
/dports/math/casadi/casadi-3.5.5/casadi/interfaces/bonmin/ |
H A D | bonmin_nlp.cpp | 33 : solver_(solver), mem_(mem) { in BonminUserClass() 34 n_ = solver_.nx_; in BonminUserClass() 35 m_ = solver_.ng_; in BonminUserClass() 55 casadi_assert_dev(n==solver_.nx_); in get_bounds_info() 56 casadi_assert_dev(m==solver_.ng_); in get_bounds_info() 65 casadi_assert_dev(n==solver_.nx_); in get_starting_point() 66 casadi_assert_dev(m==solver_.ng_); in get_starting_point() 193 if (solver_.discrete_.empty()) { in get_variables_types() 197 for (auto&& d : solver_.discrete_) { in get_variables_types() 212 casadi_assert_dev(m==solver_.nl_g_.size()); in get_constraints_linearity() [all …]
|
/dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/examples/Abc/ |
H A D | AbcModel.h | 137 OsiSolverInterface* solver_; variable 234 solver_ = rhs.clone(); in AbcModel() 322 delete solver_ ; in ~AbcModel() local 323 solver_ = 0; in ~AbcModel() 343 solver_ = NULL; in init() 403 { return solver_; } in solver() 506 { return solver_->getNumCols(); } in getNumCols() 510 { return solver_->getNumRows(); } in getNumRows() 518 { return solver_->getColLower(); } in getColLower() 522 { return solver_->getColUpper(); } in getColUpper() [all …]
|
H A D | AbcModel.cpp | 53 assert (solver_); in initialSolve() 54 solver_->initialSolve(); in initialSolve() 478 int numberRows = solver_->getNumRows(); in resolve() 491 solver_->resolve(); in resolve() 589 assert(solver_); in findIntegers() 777 solver_->resolve(); 824 solver_->setWarmStart(sharedBasis_); in takeOffCuts() 879 (solver_->getWarmStart()); in setupSelf() 1056 assert(solver_); in decodeToSelf() 1064 solver_->loadProblem(*matrixByCol, in decodeToSelf() [all …]
|
/dports/math/stanmath/math-4.2.0/stan/math/rev/functor/ |
H A D | cvodes_integrator_adjoint.hpp | 151 cvodes_solver* solver_{nullptr}; member in stan::math::cvodes_integrator_adjoint_vari 236 solver_(nullptr) { 278 solver_ = new cvodes_solver( 287 solver_->local_args_tuple_); 307 CVodeSetLinearSolver(solver_->cvodes_mem_, solver_->LS_forward_, 312 CVodeSetJacFn(solver_->cvodes_mem_, 350 = CVode(solver_->cvodes_mem_, t_final, solver_->nv_state_forward_, 398 return solver_->y_return_; in solution() 479 solver_->LS_backward_, solver_->A_backward_), in chain() 543 solver_->nv_quad_), in chain() [all …]
|
/dports/math/ogdf/OGDF/src/coin/Osi/ |
H A D | OsiAuxInfo.cpp | 52 solver_(NULL), in OsiBabSolver() 81 solver_(rhs.solver_), in OsiBabSolver() 90 assert (solver_); in OsiBabSolver() 100 solver_ = rhs.solver_; in operator =() 110 assert (solver_); in operator =() 122 if (!solver_) in solution() 158 assert (solver_); in setSolution() 171 assert (solver_); in mipBound() 173 return solver_->getObjSense()*solver_->getObjValue(); in mipBound() 181 assert (solver_); in mipFeasible() [all …]
|
/dports/math/osi/Osi-0.108.6/Osi/src/Osi/ |
H A D | OsiAuxInfo.cpp | 51 , solver_(NULL) in OsiBabSolver() 80 , solver_(rhs.solver_) in OsiBabSolver() 90 assert(solver_); in OsiBabSolver() 100 solver_ = rhs.solver_; in operator =() 111 assert(solver_); in operator =() 122 if (!solver_) in solution() 156 assert(solver_); in setSolution() 169 assert(solver_); in mipBound() 171 return solver_->getObjSense() * solver_->getObjValue(); in mipBound() 178 assert(solver_); in mipFeasible() [all …]
|
/dports/math/clp/Clp-1.17.3/Osi/src/Osi/ |
H A D | OsiAuxInfo.cpp | 51 , solver_(NULL) in OsiBabSolver() 80 , solver_(rhs.solver_) in OsiBabSolver() 90 assert(solver_); in OsiBabSolver() 100 solver_ = rhs.solver_; in operator =() 111 assert(solver_); in operator =() 122 if (!solver_) in solution() 156 assert(solver_); in setSolution() 169 assert(solver_); in mipBound() 171 return solver_->getObjSense() * solver_->getObjValue(); in mipBound() 178 assert(solver_); in mipFeasible() [all …]
|
/dports/math/casadi/casadi-3.5.5/casadi/interfaces/ipopt/ |
H A D | ipopt_nlp.cpp | 34 : solver_(solver), mem_(mem) { in IpoptUserClass() 35 n_ = solver_.nx_; in IpoptUserClass() 36 m_ = solver_.ng_; in IpoptUserClass() 72 casadi_assert_dev(n==solver_.nx_); in get_bounds_info() 73 casadi_assert_dev(m==solver_.ng_); in get_bounds_info() 82 casadi_assert_dev(n==solver_.nx_); in get_starting_point() 83 casadi_assert_dev(m==solver_.ng_); in get_starting_point() 125 casadi_int ncol = solver_.jacg_sp_.size2(); in eval_jac_g() 154 if (solver_.convexify_) { in eval_h() 294 casadi_assert_dev(n==solver_.nx_); in finalize_metadata() [all …]
|
/dports/math/mfem/mfem-4.3/linalg/ |
H A D | strumpack.cpp | 96 solver_(NULL) in STRUMPACKSolver() 104 solver_(NULL) in STRUMPACKSolver() 114 if ( solver_ != NULL ) { delete solver_; } in ~STRUMPACKSolver() 167 solver_->options().set_matching in EnableMatching() 170 solver_->options().set_mc64job in EnableMatching() 178 solver_->options().set_matching in EnableParallelMatching() 185 solver_->options().set_rel_tol( rtol ); in SetRelTol() 190 solver_->options().set_abs_tol( atol ); in SetAbsTol() 208 ReturnCode ret = solver_->factor(); in Mult() 224 solver_->solve(xPtr, yPtr); in Mult() [all …]
|
/dports/graphics/urho3d/Urho3D-1.7.1/Source/Urho3D/IK/ |
H A D | IKSolver.cpp | 50 solver_(NULL), in IKSolver() 75 ik_solver_destroy(solver_); in ~IKSolver() 127 if (solver_ != NULL) in SetAlgorithm() 131 ik_solver_destroy(solver_); in SetAlgorithm() 142 solver_->flags = initialFlags; in SetAlgorithm() 207 return solver_->tolerance; in GetTolerance() 426 ik_solver_solve(solver_); in Solve() 562 if (solver_->tree == NULL) in HandleComponentAdded() 593 if (solver_->tree == NULL) in HandleComponentRemoved() 654 if (solver_->tree == NULL) in HandleNodeAdded() [all …]
|
/dports/math/py-or-tools/or-tools-9.2/ortools/bop/ |
H A D | complete_optimizer.cc | 46 LoadStateProblemToSatSolver(problem_state, &solver_); in SynchronizeIfNeeded() 74 return solver_.ResetAndSolveWithGivenAssumptions(assumptions); in SolveWithAssumptions() 98 double deterministic_time_at_last_sync = solver_.deterministic_time(); in Optimize() 100 sat::SatParameters sat_params = solver_.parameters(); in Optimize() 106 solver_.SetParameters(sat_params); in Optimize() 108 const int64_t old_num_conflicts = solver_.num_failures(); in Optimize() 111 time_limit->AdvanceDeterministicTime(solver_.deterministic_time() - in Optimize() 113 deterministic_time_at_last_sync = solver_.deterministic_time(); in Optimize() 116 conflict_limit -= solver_.num_failures() - old_num_conflicts; in Optimize() 126 ExtractLearnedInfoFromSatSolver(&solver_, learned_info); in Optimize() [all …]
|
/dports/math/clasp/clasp-3.3.5/src/ |
H A D | unfounded_check.cpp | 73 : solver_(0) in DefaultUnfoundedCheck() 105 assert(!solver_ || solver_ == &s); in init() 108 solver_ = &s; in init() 547 if (!solver_->isFalse(a) && !(assertAtom(a, t) && solver_->propagateUntil(this))) { in falsifyUfs() 553 assert(solver_->isFalse(a)); in falsifyUfs() 637 solver_->undoUntil(dl); in computeReason() 680 …uint32 bodyAbst = solver_->isFalse(n.node->lit) ? solver_->level(n.node->lit.var()) : solver_->dec… in addDeltaReason() 712 if (!solver_->seen(p)) { in addReasonLit() 713 solver_->markSeen(p); in addReasonLit() 714 solver_->markLevel(solver_->level(p.var())); in addReasonLit() [all …]
|
/dports/math/clingo/clingo-5.5.1/clasp/src/ |
H A D | unfounded_check.cpp | 73 : solver_(0) in DefaultUnfoundedCheck() 105 assert(!solver_ || solver_ == &s); in init() 108 solver_ = &s; in init() 547 if (!solver_->isFalse(a) && !(assertAtom(a, t) && solver_->propagateUntil(this))) { in falsifyUfs() 553 assert(solver_->isFalse(a)); in falsifyUfs() 639 solver_->undoUntil(dl); in computeReason() 682 …uint32 bodyAbst = solver_->isFalse(n.node->lit) ? solver_->level(n.node->lit.var()) : solver_->dec… in addDeltaReason() 714 if (!solver_->seen(p)) { in addReasonLit() 715 solver_->markSeen(p); in addReasonLit() 716 solver_->markLevel(solver_->level(p.var())); in addReasonLit() [all …]
|
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/src/ |
H A D | unfounded_check.cpp | 73 : solver_(0) in DefaultUnfoundedCheck() 105 assert(!solver_ || solver_ == &s); in init() 108 solver_ = &s; in init() 547 if (!solver_->isFalse(a) && !(assertAtom(a, t) && solver_->propagateUntil(this))) { in falsifyUfs() 553 assert(solver_->isFalse(a)); in falsifyUfs() 639 solver_->undoUntil(dl); in computeReason() 682 …uint32 bodyAbst = solver_->isFalse(n.node->lit) ? solver_->level(n.node->lit.var()) : solver_->dec… in addDeltaReason() 714 if (!solver_->seen(p)) { in addReasonLit() 715 solver_->markSeen(p); in addReasonLit() 716 solver_->markLevel(solver_->level(p.var())); in addReasonLit() [all …]
|
/dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
H A D | CbcModel.cpp | 5519 : solver_(NULL) 5968 if (solver_) 6189 solver_ = rhs.solver_->clone(); 6350 solver_ = rhs.solver_->clone(); 9427 && 5 * solver_->getNumRows() < solver_->getNumCols()) 12119 if (solver_) { 12653 …objectiveValue = solver_->isProvenOptimal() ? solver_->getObjValue() * solver_->getObjSense() : 1.… 13919 if (solver_) 14569 checkAssociated(solver_, solver_->getColSolution(), 1); 14824 if (solver_) { [all …]
|
/dports/math/cgl-conic/CGL-CONIC-releases-1.0.0-6-gc96de60/src/CglConicIPM/ |
H A D | CglConicIPM.cpp | 37 solver_ = 0; in CglConicIPM() 55 solver_ = 0; in CglConicIPM() 68 if (solver_) delete solver_; in operator =() 73 solver_ = 0; in operator =() 81 if (solver_) in ~CglConicIPM() 82 delete solver_; in ~CglConicIPM() 186 if (solver_) { in method1() 187 delete solver_; in method1() 302 if (solver_) { in method2() 525 if (solver_) { in method3() [all …]
|
/dports/math/py-or-tools/or-tools-9.2/ortools/linear_solver/ |
H A D | cbc_interface.cc | 168 osi_.setStrParam(OsiProbName, solver_->name_); in CBCInterface() 178 osi_.setStrParam(OsiProbName, solver_->name_); in Reset() 250 if (!solver_->variables_.empty()) { in Solve() 251 solver_->LookupVariableOrNull(solver_->variables_[0]->name()); in Solve() 253 if (!solver_->constraints_.empty()) { in Solve() 254 solver_->LookupConstraintOrNull(solver_->constraints_[0]->name()); in Solve() 268 if (solver_->variables_.empty() && solver_->constraints_.empty()) { in Solve() 271 objective_value_ = solver_->Objective().offset(); in Solve() 285 const int nb_vars = solver_->variables_.size(); in Solve() 287 MPVariable* const var = solver_->variables_[i]; in Solve() [all …]
|
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
H A D | eigensparse.cc | 56 solver_.analyzePattern(lhs); in Factorize() 60 solver_.dumpMemory(ss); in Factorize() 64 if (solver_.info() != Eigen::Success) { in Factorize() 72 solver_.factorize(lhs); in Factorize() 73 if (solver_.info() != Eigen::Success) { in Factorize() 85 VectorRef(solution, solver_.cols()) = in Solve() 86 solver_.solve(ConstVectorRef(rhs, solver_.cols())); in Solve() 87 if (solver_.info() != Eigen::Success) { in Solve() 109 Solver solver_; member in ceres::internal::EigenSparseCholeskyTemplate
|
/dports/math/cgl-conic/CGL-CONIC-releases-1.0.0-6-gc96de60/src/CglConicIPMint/ |
H A D | CglConicIPMint.cpp | 37 solver_ = 0; in CglConicIPMint() 50 solver_ = 0; in CglConicIPMint() 65 solver_ = 0; in operator =() 73 if (solver_) in ~CglConicIPMint() 74 delete solver_; in ~CglConicIPMint() 178 if (solver_) { in method1() 179 delete solver_; in method1() 292 if (solver_) { in method2() 293 delete solver_; in method2() 513 if (solver_) { in method3() [all …]
|
/dports/math/openturns/openturns-1.18/lib/src/Uncertainty/Algorithm/Transformation/ProcessTransformation/ |
H A D | BoxCoxFactory.cxx | 60 mutable OptimizationAlgorithm solver_; member in BoxCoxSampleOptimization 68 , solver_(new Cobyla()) in BoxCoxSampleOptimization() 77 , solver_(solver) in BoxCoxSampleOptimization() 117 solver_.setProblem(problem); in optimizeLogLikelihood() 120 solver_.run(); in optimizeLogLikelihood() 160 , solver_(solver) in BoxCoxGLMOptimization() 194 solver_.setProblem(problem); in optimizeLogLikelihood() 197 solver_.run(); in optimizeLogLikelihood() 208 , solver_(new Cobyla()) in BoxCoxFactory() 224 return solver_; in getOptimizationAlgorithm() [all …]
|
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/solver/ |
H A D | eigen.hh | 42 : solver_(std::make_unique<EigenOp>()), absLimit_( absLimit ) in EigenInverseOperator() 47 : solver_(std::make_unique<EigenOp>()), absLimit_( absLimit ) in EigenInverseOperator() 52 : solver_(std::make_unique<EigenOp>()), absLimit_( absLimit ) in EigenInverseOperator() 59 : solver_(std::make_unique<EigenOp>()), absLimit_( absLimit ) in EigenInverseOperator() 84 … w.dofVector().array().coefficients() = solver_->solve( u.dofVector().array().coefficients() ); in operator ()() 87 unsigned int iterations () const { return solver_->iterations(); } in iterations() 94 solver_->setTolerance( absLimit_ ); in setup() 95 solver_->analyzePattern( op_->matrix().data() ); in setup() 96 solver_->factorize( op_->matrix().data() ); in setup() 100 std::unique_ptr<EigenOp> solver_; member in Dune::Fem::EigenInverseOperator
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/relay/analysis/ |
H A D | type_solver.cc | 68 TypeSolver* solver_; member in tvm::relay::TypeSolver::Reporter 88 TypeSolver* solver_; member in tvm::relay::TypeSolver::OccursChecker 113 solver_->MergeFromTo(lhs, rhs); in Unify() 119 solver_->MergeFromTo(rhs, lhs); in Unify() 131 solver_->MergeFromTo(lhs, top); in Unify() 145 OccursChecker rc(solver_, lhs); in OccursCheck() 363 TypeSolver* solver_; member in tvm::relay::TypeSolver::Unifier 384 TypeSolver* solver_; member in tvm::relay::TypeSolver::Resolver 449 TypeSolver* solver_; member in tvm::relay::TypeSolver::Propagator 483 solver_->AddToQueue(rel); in TransferLinks() [all …]
|
/dports/finance/quantlib/QuantLib-1.20/ql/methods/finitedifferences/solvers/ |
H A D | fdmhestonsolver.cpp | 56 solver_ = ext::make_shared<Fdm2DimSolver>(solverDesc_, schemeDesc_, op); in performCalculations() 61 return solver_->interpolateAt(std::log(s), v); in valueAt() 66 return solver_->derivativeX(std::log(s), v)/s; in deltaAt() 72 return (solver_->derivativeXX(x, v)-solver_->derivativeX(x, v))/(s*s); in gammaAt() 79 return deltaAt(s, v) + alpha*solver_->derivativeY(std::log(s), v); in meanVarianceDeltaAt() 88 + solver_->derivativeYY(x, v)*alpha*alpha in meanVarianceGammaAt() 89 +2*solver_->derivativeXY(x, v)*alpha/s; in meanVarianceGammaAt() 94 return solver_->thetaAt(std::log(s), v); in thetaAt()
|
/dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/ |
H A D | eigensparse.cc | 60 solver_.analyzePattern(lhs); in Factorize() 64 solver_.dumpMemory(ss); in Factorize() 68 if (solver_.info() != Eigen::Success) { in Factorize() 76 solver_.factorize(lhs); in Factorize() 77 if (solver_.info() != Eigen::Success) { in Factorize() 89 scalar_rhs_ = ConstVectorRef(rhs_ptr, solver_.cols()) in Solve() 97 scalar_solution_ = solver_.solve(scalar_rhs_); in Solve() 98 VectorRef(solution_ptr, solver_.cols()) = in Solve() 101 if (solver_.info() != Eigen::Success) { in Solve() 139 Solver solver_; member in ceres::internal::EigenSparseCholeskyTemplate
|