Home
last modified time | relevance | path

Searched refs:brDist (Results 1 – 25 of 32) sorted by relevance

12

/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/branch/operators/
H A DbranchExprTrilinear.cpp30 if (brDist) {free (brDist); brDist = NULL;} // clear it, computeMulBrDist will fill it in selectBranch()
44 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
64 …if ((xl < -COUENNE_INFINITY) && (xu > COUENNE_INFINITY)) {*brpts = 0.; brDist [0] = brDist [1] = 1… in selectBranch()
65 …if ((yl < -COUENNE_INFINITY) && (yu > COUENNE_INFINITY)) {*brpts = 0.; brDist [0] = brDist [1] = 1… in selectBranch()
66 …if ((zl < -COUENNE_INFINITY) && (zu > COUENNE_INFINITY)) {*brpts = 0.; brDist [0] = brDist [1] = 1… in selectBranch()
72 …if (u > 1.) {*brpts = 0.; brDist [0] = brDist [1] = 1.; var = arglist_ [ind]; return… in selectBranch()
73 …else {*brpts = 2*-fabs (u) - 1.; brDist [0] = brDist [1] = 1.; var = arglist_ [ind]; return… in selectBranch()
77 …if (l < -1.) {*brpts = 0.; brDist [0] = brDist [1] = 1.; var = arglist_ [ind]; return… in selectBranch()
78 …else {*brpts = 2*fabs (u) + 1.; brDist [0] = brDist [1] = 1.; var = arglist_ [ind]; return… in selectBranch()
87 … - xl > yu - yl) && (xu - xl > zu - zl)) {*brpts = .5 * (xl + xu); brDist [0] = brDist [1] = 1.; v… in selectBranch()
[all …]
H A DbranchExprPow.cpp75 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
84 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
137 return (brDist [0] = brDist [1] = fabs (y0 - pow (x0,k))); in selectBranch()
245 return (brDist [0] = brDist [1] = fabs (pow0 - y0)); in selectBranch()
272 brDist [1] = sqrt (brDist [0] * brDist [0] + (x0 - *brpts) * (x0 - *brpts)); in selectBranch()
277 brDist [0] = sqrt (brDist [1] * brDist [1] + (x0 - *brpts) * (x0 - *brpts)); in selectBranch()
307 return (brDist [0] = brDist [1] = fabs (pow0 - y0)); in selectBranch()
336 brDist [1] = sqrt (brDist [0] * brDist [0] + (x0 - *brpts) * (x0 - *brpts)); in selectBranch()
341 brDist [0] = sqrt (brDist [1] * brDist [1] + (x0 - *brpts) * (x0 - *brpts)); in selectBranch()
344 return CoinMax (brDist [0], brDist [1]); in selectBranch()
[all …]
H A DbranchExprInv.cpp32 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in negPowSelectBranch()
87 brDist [1] = CoinMax (fabs (x0), 1.); in negPowSelectBranch()
90 double swap = brDist [0]; in negPowSelectBranch()
91 brDist [0] = brDist [1]; in negPowSelectBranch()
92 brDist [1] = swap; in negPowSelectBranch()
95 return CoinMin (brDist [0], brDist [1]); in negPowSelectBranch()
125 return (brDist [0] = brDist [1] = sqrt (x0*x0 + dy*dy)); // distance is exact in negPowSelectBranch()
154 brDist [1] = *brpts - x0; in negPowSelectBranch()
156 brDist [0] = x0 - *brpts; in negPowSelectBranch()
169 return CoinMin (brDist [0], brDist [1]); in negPowSelectBranch()
[all …]
H A DbranchExprDiv.cpp24 double * &brDist, // distance of current LP in selectBranch() argument
28 if (brDist) {free (brDist); brDist = NULL;} // clear it, computeMulBrDist will fill it in selectBranch()
56 brDist = computeMulBrDist (info, wi, yi, xi, yi, brpts); in selectBranch()
58 return CoinMin (brDist [0], brDist [1]); in selectBranch()
87 brDist = computeMulBrDist (info, wi, yi, xi, yi, brpts); in selectBranch()
89 return CoinMin (brDist [0], brDist [1]); in selectBranch()
126 brDist = computeMulBrDist (info, wi, yi, xi, wi, brpts); in selectBranch()
127 return CoinMin (brDist [0], brDist [1]); in selectBranch()
140 brDist = computeMulBrDist (info, wi, yi, xi, wi, brpts); in selectBranch()
141 return CoinMin (brDist [0], brDist [1]); in selectBranch()
[all …]
H A DbranchExprMul.cpp27 double * &brDist, // distance of current LP in selectBranch() argument
31 if (brDist) {free (brDist); brDist = NULL;} // clear it, computeMulBrDist will fill it in selectBranch()
64 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
70 return CoinMin (brDist [0], brDist [1]); in selectBranch()
77 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
79 brDist [0] = projectSeg (x0, y0, xl, xl*yl, *brpts, *brpts * yl, 0); in selectBranch()
80 brDist [1] = projectSeg (x0, y0, *brpts, *brpts * yl, xu, xu*yl, 0); in selectBranch()
83 return CoinMin (brDist [0], brDist [1]); in selectBranch()
95 return CoinMin (brDist [0], brDist [1]); in selectBranch()
165 brDist = computeMulBrDist (info, xi, yi, wi, ind, brpts); in selectBranch()
[all …]
H A DbranchExprExp.cpp27 double * &brDist, // distance of current LP in selectBranch() argument
48 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
76 return sqrt (brDist [0] = brDist [1] = sqrt (x0*x0 + y0*y0)); // exact distance in selectBranch()
102 return CoinMin (brDist [0] = log (y0) - x0, in selectBranch()
103 brDist [1] = y0 - exp (x0)); in selectBranch()
113 return CoinMin (brDist [0] = y0 - exp (x0), in selectBranch()
114 brDist [1] = projectSeg (x0, y0, *brpts, exp (*brpts), u, exp (u), -1)); in selectBranch()
122 return CoinMin (brDist [0] = projectSeg (x0, y0, l, exp (l), *brpts, exp (*brpts), -1), in selectBranch()
123 brDist [1] = log (y0) - x0); in selectBranch()
135 …return CoinMin (brDist [0] = projectSeg (x0, y0, l, exp (l), *brpts, exp (*brpts), -1), in selectBranch()
[all …]
H A DbranchExprLog.cpp29 double * &brDist, // distance of current LP in selectBranch() argument
34 brDist = (double *) realloc (brDist, 2*sizeof (double)); in selectBranch()
85 return (brDist [0] = brDist [1] = sqrt (x0*x0 + dy*dy)); // exact distance in selectBranch()
113 return CoinMin (brDist [0] = x0 - exp (y0), in selectBranch()
114 brDist [1] = log (x0) - y0); in selectBranch()
126 brDist [0] = x0 - *brpts; in selectBranch()
127 … return (brDist [1] = projectSeg (x0, y0, *brpts, log (*brpts), u, log (u), +1)); // exact distance in selectBranch()
136 brDist [1] = log (*brpts) - y0; in selectBranch()
138 … return (brDist [0] = projectSeg (x0, y0, l, log (l), *brpts, log (*brpts), +1)); // exact distance in selectBranch()
157 …return CoinMin (brDist [0] = projectSeg (x0, y0, l, log (l), *brpts, log (*brpts), +1), in selectBranch()
[all …]
H A DbranchExprAbs.cpp32 double * &brDist, // distance of current LP in selectBranch() argument
55 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in selectBranch()
60 brDist [0] = (x0 + y0) / M_SQRT2l; in selectBranch()
61 brDist [1] = (y0 - x0) / M_SQRT2l; in selectBranch()
65 return CoinMin (brDist [0], brDist [1]); in selectBranch()
H A DbranchExprSinCos.cpp30 double * &brDist, // distance of current LP in trigSelBranch() argument
54 brDist = (double *) realloc (brDist, 2*sizeof (double)); in trigSelBranch()
57 return (brDist [0] = brDist [1] = y0 - ((type == COU_SINE) ? sin(x0) : cos(x0))); in trigSelBranch()
H A DbranchExprQuad.cpp27 double * &brDist, // distance of current LP in selectBranch() argument
43 brDist = (double *) realloc (brDist, 2*sizeof (double)); in selectBranch()
152 return (brDist [0] = brDist [1] = fabs (delta)); in selectBranch()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/branch/
H A DCouenneVarObject.cpp174 *brDist = NULL, // distances from LP point to each new convexification in computeBranchingPoint() local
207 brVar, brPts, brDist, whichWay); // result: who, where, distances, direction in computeBranchingPoint()
212 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in computeBranchingPoint()
219 if (point > floor (point)) {improv = brDist [0] = point - floor (point);} in computeBranchingPoint()
220 if (point < ceil (point)) {improv = CoinMin (improv, brDist [1] = ceil (point) - point);} in computeBranchingPoint()
244 brdistDn = brDist [0]; in computeBranchingPoint()
245 brdistUp = brDist [1]; in computeBranchingPoint()
331 if (brDist) free (brDist); in computeBranchingPoint()
H A DCouenneObject.cpp178 *brDist = NULL; // distances from current LP point to each in createBranch() local
188 brVar, brPts, brDist, whichWay); // result: who, where, distance, and direction in createBranch()
195 brDist = (double *) realloc (brDist, 2 * sizeof (double)); in createBranch()
202 if (point > floor (point)) {improv = brDist [0] = point - floor (point);} in createBranch()
203 if (point < ceil (point)) {improv = CoinMin (improv, brDist [1] = ceil (point) - point);} in createBranch()
223 downEstimate_ = brDist [0]; in createBranch()
224 upEstimate_ = brDist [1]; in createBranch()
262 if (brDist) free (brDist); in createBranch()
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/expression/operators/
H A DCouenneExprSin.hpp36 double * &brDist, // distance of current LP
115 double * &brDist, // distance of current LP in selectBranch() argument
119 {return trigSelBranch (obj, info, var, brpts, brDist, way, COU_SINE);} in selectBranch()
H A DCouenneExprCos.hpp88 double * &brDist, // distance of current LP in selectBranch() argument
91 {return trigSelBranch (obj, info, var, brpts, brDist, way, COU_COSINE);} in selectBranch()
H A DCouenneExprTrilinear.hpp65 double * &brDist, // distance of current LP
H A DCouenneExprSignPow.hpp74 double * &brDist, // distance of current LP
H A DCouenneExprLog.hpp72 double * &brDist, // distance of current LP
H A DCouenneExprAbs.hpp78 double * &brDist, // distance of current LP
H A DCouenneExprExp.hpp73 double * &brDist, // distance of current LP
H A DCouenneExprEvenPow.hpp80 double * &brDist, // distance of current LP
H A DCouenneExprOddPow.hpp80 double * &brDist, // distance of current LP
H A DCouenneExprBinProd.hpp73 double * &brDist, // distance of current LP
H A DCouenneExprFloor.hpp79 double * &brDist, // distance of current LP in selectBranch() argument
H A DCouenneExprCeil.hpp79 double * &brDist, // distance of current LP in selectBranch() argument
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/expression/
H A DCouenneExprCopy.hpp203 double * &brDist, // distance of current LP in selectBranch() argument
207 {return copy_ -> selectBranch (obj, info, var, brpts, brDist, way);} in selectBranch()

12