Home
last modified time | relevance | path

Searched refs:ub_i (Results 1 – 9 of 9) sorted by relevance

/dports/math/casadi/casadi-3.5.5/casadi/core/runtime/
H A Dcasadi_sum_viol.hpp10 T1 x_i, lb_i, ub_i; in casadi_sum_viol() local
13 ub_i = ub ? *ub++ : zero; in casadi_sum_viol()
14 r += fmax(x_i-ub_i, zero); in casadi_sum_viol()
H A Dcasadi_max_viol.hpp10 T1 x_i, lb_i, ub_i; in casadi_max_viol() local
13 ub_i = ub ? *ub++ : zero; in casadi_max_viol()
14 r = fmax(r, fmax(x_i-ub_i, zero)); in casadi_max_viol()
/dports/graphics/opencollada/OpenCOLLADA-1.6.68/Externals/MayaDataModel/include/
H A DMayaDMObjectSet.h104 void getUsedBy(size_t ub_i)const in getUsedBy() argument
106 fprintf(mFile,"\"%s.ub[%i]\"",mName.c_str(),ub_i); in getUsedBy()
/dports/science/siconos/siconos-4.4.0/docs/sphinx/users_guide/problems_and_solvers/
H A Drelay.rst25 … K is the box defined by :math:`K=\{x\in\mathbb{R}^n\mid lb_i\leq x_i\leq ub_i,i=1,...,n\}` and :m…
/dports/math/octave-forge-optim/optim-1.6.1/inst/private/
H A D__samin__.m34 ## product of the (lb_i, ub_i), i = 1,2,..n
/dports/devel/ppl/ppl-1.2/src/
H A DOctagonal_Shape_templates.hh7686 row_reference ub_i = *(ub_m_begin + i); in upper_bound_assign_if_exact() local
7687 const N& ub_i_ci = ub_i[ci]; in upper_bound_assign_if_exact()
7721 : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]); in upper_bound_assign_if_exact()
7738 : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]); in upper_bound_assign_if_exact()
7883 row_reference ub_i = *(ub_m_begin + i); in integer_upper_bound_assign_if_exact() local
7884 const N& ub_i_ci = ub_i[ci]; in integer_upper_bound_assign_if_exact()
7919 : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]); in integer_upper_bound_assign_if_exact()
7938 : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]); in integer_upper_bound_assign_if_exact()
H A DBD_Shape_templates.hh2417 const DB_Row<N>& ub_i = ub.dbm[i]; in BHZ09_upper_bound_assign_if_exact() local
2445 const N& ub_i_ell = (i == ell) ? temp_zero : ub_i[ell]; in BHZ09_upper_bound_assign_if_exact()
H A Dppl.hh.dist78740 row_reference ub_i = *(ub_m_begin + i);
78741 const N& ub_i_ci = ub_i[ci];
78775 : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
78792 : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
78937 row_reference ub_i = *(ub_m_begin + i);
78938 const N& ub_i_ci = ub_i[ci];
78973 : ((ck < row_size_i) ? ub_i[ck] : ub_k[ci]);
78992 : ((ell < row_size_i) ? ub_i[ell] : ub_cell[ci]);
82964 const DB_Row<N>& ub_i = ub.dbm[i];
82992 const N& ub_i_ell = (i == ell) ? temp_zero : ub_i[ell];
/dports/math/nlopt/nlopt-2.7.1/doc/docs/
H A DNLopt_Introduction.md18 $$lb_i \leq x_i \leq ub_i$$ for $i=1,\ldots,n$
20 …spectively, for partially or totally unconstrained problems). (If $lb_i = ub_i$, that parameter is…