#include <exprPow.hpp>
Inheritance diagram for exprPow:
Public Member Functions | |
exprPow (expression **al, int n=2) | |
Constructor. | |
exprPow (expression *arg0, expression *arg1) | |
Constructor with only two arguments. | |
expression * | clone (Domain *d=NULL) const |
cloning method | |
std::string | printOp () const |
print operator | |
CouNumber | operator() () |
function for the evaluation of the expression | |
CouNumber | gradientNorm (const double *x) |
return l-2 norm of gradient at given point | |
expression * | differentiate (int index) |
differentiation | |
expression * | simplify () |
simplification | |
int | Linearity () |
get a measure of "how linear" the expression is | |
bool | isInteger () |
is this expression integer? | |
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). | |
exprAux * | standardize (CouenneProblem *p, bool addAux=true) |
reduce expression in standard form, creating additional aux variables (and constraints) | |
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 | |
expression * | getFixVar () |
return an index to the variable's argument that is better fixed in a branching rule for solving a nonconvexity gap | |
virtual enum expr_type | code () |
code for comparison | |
bool | impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *) |
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 void | closestFeasible (expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const |
compute $y^{lv}$ and $y^{uv}$ for Violation Transfer algorithm | |
virtual bool | isCuttable (CouenneProblem *problem, int index) const |
can this expression be further linearized or are we on its concave ("bad") side |
Definition at line 26 of file exprPow.hpp.
exprPow::exprPow | ( | expression ** | al, | |
int | n = 2 | |||
) | [inline] |
exprPow::exprPow | ( | expression * | arg0, | |
expression * | arg1 | |||
) | [inline] |
expression* exprPow::clone | ( | Domain * | d = NULL |
) | const [inline, virtual] |
cloning method
Reimplemented from expression.
Definition at line 39 of file exprPow.hpp.
References exprOp::clonearglist(), exprPow(), and exprOp::nargs_.
std::string exprPow::printOp | ( | ) | const [inline, virtual] |
CouNumber exprPow::operator() | ( | ) | [inline, virtual] |
function for the evaluation of the expression
Implements expression.
Definition at line 157 of file exprPow.hpp.
References exprOp::arglist_, and safe_pow().
CouNumber exprPow::gradientNorm | ( | const double * | x | ) | [virtual] |
expression* exprPow::differentiate | ( | int | index | ) | [virtual] |
expression* exprPow::simplify | ( | ) | [virtual] |
int exprPow::Linearity | ( | ) | [virtual] |
bool exprPow::isInteger | ( | ) | [virtual] |
void exprPow::getBounds | ( | expression *& | , | |
expression *& | ||||
) | [virtual] |
exprAux* exprPow::standardize | ( | CouenneProblem * | p, | |
bool | addAux = true | |||
) | [virtual] |
reduce expression in standard form, creating additional aux variables (and constraints)
Reimplemented from exprOp.
void exprPow::generateCuts | ( | expression * | w, | |
OsiCuts & | cs, | |||
const CouenneCutGenerator * | cg, | |||
t_chg_bounds * | = NULL , |
|||
int | = -1 , |
|||
CouNumber | = -COUENNE_INFINITY , |
|||
CouNumber | = COUENNE_INFINITY | |||
) | [virtual] |
expression* exprPow::getFixVar | ( | ) | [inline] |
return an index to the variable's argument that is better fixed in a branching rule for solving a nonconvexity gap
Definition at line 83 of file exprPow.hpp.
References exprOp::arglist_.
virtual enum expr_type exprPow::code | ( | ) | [inline, virtual] |
code for comparison
Reimplemented from exprOp.
Definition at line 87 of file exprPow.hpp.
References COU_EXPRPOW.
bool exprPow::impliedBound | ( | int | , | |
CouNumber * | , | |||
CouNumber * | , | |||
t_chg_bounds * | ||||
) | [virtual] |
virtual CouNumber exprPow::selectBranch | ( | const CouenneObject * | obj, | |
const OsiBranchingInformation * | info, | |||
expression *& | var, | |||
double *& | brpts, | |||
double *& | brDist, | |||
int & | way | |||
) | [virtual] |
set up branching object by evaluating many branching points for each expression's arguments
Reimplemented from expression.
virtual void exprPow::closestFeasible | ( | expression * | varind, | |
expression * | vardep, | |||
CouNumber & | left, | |||
CouNumber & | right | |||
) | const [virtual] |
virtual bool exprPow::isCuttable | ( | CouenneProblem * | problem, | |
int | index | |||
) | const [virtual] |
can this expression be further linearized or are we on its concave ("bad") side
Reimplemented from expression.