Couenne 0.5.8
|
class inverse:
#include <CouenneExprInv.hpp>
Public Member Functions | |
exprInv (expression *al) | |
Constructors, destructor. | |
expression * | clone (Domain *d=NULL) const |
cloning method | |
unary_function | F () |
the operator's function | |
virtual void | print (std::ostream &out=std::cout, bool=false) const |
output "1/argument" | |
CouNumber | gradientNorm (const double *x) |
return l-2 norm of gradient at given point | |
expression * | differentiate (int index) |
differentiation | |
virtual int | Linearity () |
get a measure of "how linear" the expression is (see CouenneTypes.h) | |
void | getBounds (expression *&, expression *&) |
Get lower and upper bound of an expression (if any) | |
void | getBounds (CouNumber &lb, CouNumber &ub) |
Get value of lower and upper bound of an expression (if any) | |
void | generateCuts (expression *w, OsiCuts &cs, const CouenneCutGenerator *cg, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY) |
generate equality between *this and *w | |
virtual enum expr_type | code () |
code for comparisons | |
bool | impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *, enum auxSign=expression::AUX_EQ) |
implied bound processing | |
virtual CouNumber | selectBranch (const CouenneObject *obj, const OsiBranchingInformation *info, expression *&var, double *&brpts, double *&brDist, int &way) |
set up branching object by evaluating many branching points for each expression's arguments | |
virtual bool | isBijective () const |
return true if bijective | |
virtual CouNumber | inverse (expression *vardep) const |
return inverse of y=f(x)=1/x, i.e., x=1/y | |
virtual bool | isCuttable (CouenneProblem *problem, int index) const |
can this expression be further linearized or are we on its concave ("bad") side | |
![]() | |
virtual enum nodeType | Type () const |
node type | |
exprUnary (expression *argument) | |
Constructor. | |
virtual | ~exprUnary () |
Destructor. | |
int | nArgs () const |
return number of arguments | |
virtual expression * | Argument () const |
return argument | |
virtual expression ** | ArgPtr () |
return pointer to argument | |
virtual enum pos | printPos () const |
print position (PRE, INSIDE, POST) | |
virtual std::string | printOp () const |
print operator | |
virtual CouNumber | operator() () |
compute value of unary operator | |
virtual int | DepList (std::set< int > &deplist, enum dig_type type=ORIG_ONLY) |
fill in the set with all indices of variables appearing in the expression | |
expression * | simplify () |
simplification | |
virtual exprAux * | standardize (CouenneProblem *, bool addAux=true) |
reduce expression in standard form, creating additional aux variables (and constraints) | |
virtual bool | isInteger () |
is this expression integer? | |
virtual int | compare (exprUnary &) |
compare two unary functions | |
virtual int | rank () |
used in rank-based branching variable choice | |
virtual void | fillDepSet (std::set< DepNode *, compNode > *dep, DepGraph *g) |
fill in dependence structure | |
virtual void | replace (exprVar *, exprVar *) |
replace variable with other | |
virtual void | realign (const CouenneProblem *p) |
empty function to redirect variables to proper variable vector | |
![]() | |
expression () | |
Constructor. | |
expression (const expression &e, Domain *d=NULL) | |
Copy constructor. | |
virtual | ~expression () |
Destructor. | |
virtual int | Index () const |
Return index of variable (only valid for exprVar and exprAux) | |
virtual expression ** | ArgList () const |
return arglist (when applicable, that is, with N-ary functions) | |
virtual void | ArgList (expression **al) |
set arglist (used in deleting nodes without deleting children) | |
virtual expression * | Image () const |
return pointer to corresponding expression (for auxiliary variables only) | |
virtual void | Image (expression *image) |
set expression associated with this auxiliary variable (for compatibility with exprAux) | |
virtual CouNumber | Value () const |
value (empty) | |
virtual const expression * | Original () const |
If this is an exprClone of a exprClone of an expr? | |
virtual int | dependsOn (int *ind, int n, enum dig_type type=STOP_AT_AUX) |
dependence on variable set: return cardinality of subset of the set of indices in first argument which occur in expression. | |
int | dependsOn (int singleton, enum dig_type type=STOP_AT_AUX) |
version with one index only | |
virtual bool | isDefinedInteger () |
is this expression defined as an integer? | |
virtual enum convexity | convexity () const |
either CONVEX, CONCAVE, AFFINE, or NONCONVEX | |
virtual int | compare (expression &) |
compare expressions | |
virtual int | compare (exprCopy &) |
compare copies of expressions | |
virtual int | Multiplicity () |
multiplicity of a variable | |
virtual void | linkDomain (Domain *d) |
empty function to update domain pointer | |
virtual void | closestFeasible (expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const |
closest feasible points in function in both directions | |
virtual bool | isaCopy () const |
return true if this is a copy of something (i.e. an exprCopy) | |
virtual expression * | Copy () const |
return copy of this expression (only makes sense in exprCopy) | |
Additional Inherited Members | |
![]() | |
enum | auxSign { AUX_UNDEF =-2 , AUX_LEQ =-1 , AUX_EQ , AUX_GEQ } |
"sign" of the constraint defining an auxiliary. More... | |
![]() | |
expression * | argument_ |
single argument taken by this expression | |
class inverse:
Definition at line 35 of file CouenneExprInv.hpp.
|
inline |
Constructors, destructor.
Definition at line 40 of file CouenneExprInv.hpp.
|
inlinevirtual |
cloning method
Reimplemented from Couenne::expression.
Definition at line 44 of file CouenneExprInv.hpp.
|
inlinevirtual |
the operator's function
Reimplemented from Couenne::exprUnary.
Definition at line 48 of file CouenneExprInv.hpp.
|
virtual |
output "1/argument"
Reimplemented from Couenne::exprUnary.
|
virtual |
return l-2 norm of gradient at given point
Reimplemented from Couenne::expression.
|
virtual |
differentiation
Reimplemented from Couenne::expression.
|
inlinevirtual |
get a measure of "how linear" the expression is (see CouenneTypes.h)
Reimplemented from Couenne::exprUnary.
Definition at line 60 of file CouenneExprInv.hpp.
|
virtual |
Get lower and upper bound of an expression (if any)
Reimplemented from Couenne::expression.
Get value of lower and upper bound of an expression (if any)
Reimplemented from Couenne::expression.
|
virtual |
generate equality between *this and *w
Reimplemented from Couenne::expression.
|
inlinevirtual |
code for comparisons
Reimplemented from Couenne::exprUnary.
Definition at line 79 of file CouenneExprInv.hpp.
|
virtual |
implied bound processing
Reimplemented from Couenne::expression.
|
virtual |
set up branching object by evaluating many branching points for each expression's arguments
Reimplemented from Couenne::expression.
|
inlinevirtual |
return true if bijective
Reimplemented from Couenne::expression.
Definition at line 95 of file CouenneExprInv.hpp.
|
inlinevirtual |
return inverse of y=f(x)=1/x, i.e., x=1/y
Reimplemented from Couenne::expression.
Definition at line 98 of file CouenneExprInv.hpp.
|
virtual |
can this expression be further linearized or are we on its concave ("bad") side
Reimplemented from Couenne::expression.