Searched refs:c_lin (Results 1 – 4 of 4) sorted by relevance
| /dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_trlib/ |
| H A D | trlib_quadratic_zero.c | 30 trlib_int_t trlib_quadratic_zero(trlib_flt_t c_abs, trlib_flt_t c_lin, trlib_flt_t tol, in trlib_quadratic_zero() argument
36 trlib_flt_t lin_sq = c_lin*c_lin; in trlib_quadratic_zero()
44 if ( fabs(q) <= (TRLIB_EPS*c_lin)*(TRLIB_EPS*c_lin) ) { in trlib_quadratic_zero()
48 *t1 = -.5*c_lin; *t2 = *t1; in trlib_quadratic_zero()
59 *t1 = -.5 * ( c_lin + copysign( sqrt(q), c_lin ) ); in trlib_quadratic_zero()
66 if (c_lin < 0.0) { *t1 = 0.0; *t2 = - c_lin; } in trlib_quadratic_zero()
67 else { *t1 = - c_lin; *t2 = 0.0; } in trlib_quadratic_zero()
71 q = (*t1+c_lin)*(*t1)+c_abs; dq = 2.0*(*t1)+c_lin; in trlib_quadratic_zero()
73 q = (*t2+c_lin)*(*t2)+c_abs; dq = 2.0*(*t2)+c_lin; in trlib_quadratic_zero()
|
| /dports/math/bonmin/Bonmin-releases-1.8.8/Bonmin/src/CbcBonmin/Heuristics/ |
| H A D | BonMilpRounding.cpp | 123 vector<Ipopt::TNLP::LinearityType> c_lin(m); in solution() local
124 tminlp->get_constraints_linearity(m, c_lin()); in solution()
128 if (c_lin[i]==Ipopt::TNLP::LINEAR) in solution()
215 if(c_lin[i] == Ipopt::TNLP::LINEAR) continue; in solution()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_trlib/trlib/ |
| H A D | trlib_quadratic_zero.h | 53 trlib_int_t trlib_quadratic_zero(trlib_flt_t c_abs, trlib_flt_t c_lin, trlib_flt_t tol,
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/inactive/ |
| H A D | rSQPOptimizer.C | 483 DVectorSlice c_lin = (*c)(1,num_lin_eq_); in imp_calc_point() local
484 V_mV( &c_lin, my_vec_view(dakota_rsqp_opt_->lin_eq_targ()) ); in imp_calc_point()
488 c_lin[j] += lin_eq_jac[j][i] * x_orig[i]; in imp_calc_point()
|