#include <Variables.h>
Inheritance diagram for Variables:
Public Methods | |
virtual double | mu ()=0 |
virtual double | mustep (Variables *step, double alpha)=0 |
virtual void | negate ()=0 |
virtual void | saxpy (Variables *b, double alpha)=0 |
virtual double | stepbound (Variables *b)=0 |
virtual double | findBlocking (Variables *step, double &primalValue, double &primalStep, double &dualValue, double &dualStep, int &firstOrSecond)=0 |
virtual void | interiorPoint (double alpha, double beta)=0 |
virtual void | shiftBoundVariables (double alpha, double beta)=0 |
virtual double | violation ()=0 |
virtual void | print () |
virtual void | copy (Variables *b)=0 |
virtual double | onenorm ()=0 |
virtual double | infnorm ()=0 |
Public Attributes | |
int | nComplementaryVariables |
|
copy the variables Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
Performs the same function as stepbound, and supplies additional information about which component of the nonnegative variables is responsible for restricting alpha. In terms of the abstract formulation, the components have the following meanings.
Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
compute the inf-norm of the variables Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
In the abstract QP formulation, sets s to alpha, z to beta and the other variable components to zero. Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
compute complementarity gap, obtained by taking the inner product of the complementary vectors and dividing by the total number of components Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
compute the complementarity gap resulting from a step of length "alpha" along direction "step" Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
negate the value of all the variables in this structure Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
compute the 1-norm of the variables Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
print the variables Reimplemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
given variables b, compute a <- a + alpha b, where a are the variables in this class Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
In the standard QP formulation, sets s += alpha, z += beta Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
calculate the largest alpha in (0,1] such that the nonnegative variables stay nonnegative in the given search direction. In the abstract problem formulation, this is the largest value of alpha such that (s,z) + alpha * (b->s,b->z) >= 0.
Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
The amount by which the current variables violate the non-negativity constraints. Implemented in HuberVars, QpBoundVars, QpExampleVars, QpGenVars, and SvmVars. |
|
number of complementary primal-dual variables. |