Power of an expression (binary operator),
with
constant.
More...
#include <CouenneExprPow.hpp>


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 | |
| virtual std::string | printOp () const |
| print operator | |
| virtual CouNumber | operator() () |
| function for the evaluation of the expression | |
| virtual CouNumber | gradientNorm (const double *x) |
| return l-2 norm of gradient at given point | |
| virtual expression * | differentiate (int index) |
| differentiation | |
| virtual expression * | simplify () |
| simplification | |
| virtual int | Linearity () |
| get a measure of "how linear" the expression is | |
| virtual bool | isInteger () |
| is this expression integer? | |
| virtual void | getBounds (expression *&, expression *&) |
| Get lower and upper bound of an expression (if any). | |
| virtual void | getBounds (CouNumber &lb, CouNumber &ub) |
| Get value of lower and upper bound of an expression (if any). | |
| virtual exprAux * | standardize (CouenneProblem *p, bool addAux=true) |
| reduce expression in standard form, creating additional aux variables (and constraints) | |
| virtual 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 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 | |
| virtual 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 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 | |
Power of an expression (binary operator),
with
constant.
Definition at line 29 of file CouenneExprPow.hpp.
| Couenne::exprPow::exprPow | ( | expression ** | al, | |
| int | n = 2 | |||
| ) | [inline] |
Constructor.
Definition at line 34 of file CouenneExprPow.hpp.
| Couenne::exprPow::exprPow | ( | expression * | arg0, | |
| expression * | arg1 | |||
| ) | [inline] |
Constructor with only two arguments.
Definition at line 38 of file CouenneExprPow.hpp.
| expression* Couenne::exprPow::clone | ( | Domain * | d = NULL |
) | const [inline, virtual] |
cloning method
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprOddPow.
Definition at line 42 of file CouenneExprPow.hpp.
| virtual std::string Couenne::exprPow::printOp | ( | ) | const [inline, virtual] |
print operator
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprOddPow.
Definition at line 46 of file CouenneExprPow.hpp.
| CouNumber Couenne::exprPow::operator() | ( | ) | [inline, virtual] |
function for the evaluation of the expression
compute power
Implements Couenne::expression.
Reimplemented in Couenne::exprOddPow.
Definition at line 160 of file CouenneExprPow.hpp.
| CouNumber exprPow::gradientNorm | ( | const double * | x | ) | [virtual] |
return l-2 norm of gradient at given point
Reimplemented from Couenne::expression.
Definition at line 357 of file exprPow.cpp.
| expression * exprPow::differentiate | ( | int | index | ) | [virtual] |
differentiation
differentiate power of expressions
Reimplemented from Couenne::expression.
Definition at line 114 of file exprPow.cpp.
| expression * exprPow::simplify | ( | ) | [virtual] |
simplification
simplify power f(x) ^ g(x)
Reimplemented from Couenne::exprOp.
Definition at line 31 of file exprPow.cpp.
| int exprPow::Linearity | ( | ) | [virtual] |
get a measure of "how linear" the expression is
get a measure of "how linear" the expression is:
ZERO = 0: a zero CONSTANT = 1: a constant LINEAR = 2: linear QUADRATIC = 3: quadratic NONLINER = 4: nonlinear non-quadratic
Reimplemented from Couenne::exprOp.
Definition at line 183 of file exprPow.cpp.
| bool exprPow::isInteger | ( | ) | [virtual] |
is this expression integer?
Reimplemented from Couenne::exprOp.
Definition at line 229 of file exprPow.cpp.
| void exprPow::getBounds | ( | expression *& | lb, | |
| expression *& | ub | |||
| ) | [virtual] |
Get lower and upper bound of an expression (if any).
Reimplemented in Couenne::exprOddPow.
Definition at line 31 of file conv-exprPow-getBounds.cpp.
Get value of lower and upper bound of an expression (if any).
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprOddPow.
Definition at line 185 of file conv-exprPow-getBounds.cpp.
| exprAux * exprPow::standardize | ( | CouenneProblem * | p, | |
| bool | addAux = true | |||
| ) | [virtual] |
reduce expression in standard form, creating additional aux variables (and constraints)
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprOddPow.
Definition at line 37 of file conv-exprPow.cpp.
| void exprPow::generateCuts | ( | expression * | w, | |
| OsiCuts & | cs, | |||
| const CouenneCutGenerator * | cg, | |||
| t_chg_bounds * | chg = NULL, |
|||
| int | wind = -1, |
|||
| CouNumber | lbw = -COUENNE_INFINITY, |
|||
| CouNumber | ubw = COUENNE_INFINITY | |||
| ) | [virtual] |
generate equality between *this and *w
Reimplemented in Couenne::exprOddPow.
Definition at line 104 of file conv-exprPow.cpp.
| virtual expression* Couenne::exprPow::getFixVar | ( | ) | [inline, virtual] |
return an index to the variable's argument that is better fixed in a branching rule for solving a nonconvexity gap
Reimplemented in Couenne::exprOddPow.
Definition at line 86 of file CouenneExprPow.hpp.
| virtual enum expr_type Couenne::exprPow::code | ( | ) | [inline, virtual] |
code for comparison
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprOddPow.
Definition at line 90 of file CouenneExprPow.hpp.
| virtual bool Couenne::exprPow::impliedBound | ( | int | , | |
| CouNumber * | , | |||
| CouNumber * | , | |||
| t_chg_bounds * | , | |||
| enum | auxSign = expression::AUX_EQ | |||
| ) | [virtual] |
implied bound processing
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprOddPow.
| 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 in Couenne::exprOddPow.
Definition at line 35 of file branchExprPow.cpp.
| void exprPow::closestFeasible | ( | expression * | varind, | |
| expression * | vardep, | |||
| CouNumber & | left, | |||
| CouNumber & | right | |||
| ) | const [virtual] |
compute $y^{lv}$ and $y^{uv}$ for Violation Transfer algorithm
Definition at line 284 of file exprPow.cpp.
| 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 Couenne::expression.
Reimplemented in Couenne::exprOddPow.
Definition at line 367 of file exprPow.cpp.
1.6.1