#include <QpExampleVars.h>
Inheritance diagram for QpExampleVars:
Public Methods | |
virtual void | saxpy (Variables *b, double alpha) |
virtual void | negate () |
virtual double | mu () |
virtual double | mustep (Variables *step, double alpha) |
virtual double | stepbound (Variables *b) |
virtual double | violation () |
virtual double | findBlocking (Variables *step, double &primalValue, double &primalStep, double &dualValue, double &dualStep, int &firstOrSecond) |
virtual void | interiorPoint (double alpha, double beta) |
virtual void | shiftBoundVariables (double alpha, double beta) |
virtual void | print () |
virtual double | onenorm () |
virtual double | infnorm () |
virtual void | copy (Variables *b) |
Public Attributes | |
OoqpVector * | x |
OoqpVector * | s |
OoqpVector * | y |
OoqpVector * | z |
|
copy the variables Implements Variables. |
|
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.
Implements Variables. |
|
compute the inf-norm of the variables Implements Variables. |
|
sets components of s to alpha and of z to beta Implements Variables. |
|
compute complementarity gap, obtained by taking the inner product of the complementary vectors and dividing by the total number of components Implements Variables. |
|
compute the complementarity gap resulting from a step of length "alpha" along direction "step" Implements Variables. |
|
negate the value of all the variables in this structure Implements Variables. |
|
compute the 1-norm of the variables Implements Variables. |
|
print the variables Reimplemented from Variables. |
|
given variables b, compute a <- a + alpha b, where a are the variables in this class Implements Variables. |
|
adds alpha to components of s and beta to components of z Implements Variables. |
|
calculate the largest alpha in (0,1] such that the nonnegative variables stay nonnegative in the given search direction. In the general QP problem formulation, this is the largest value of alpha such that (s,z) + alpha * (b->s,b->z) >= 0.
Implements Variables. |
|
The amount by which the current variables violate the non-negativity constraints. Implements Variables. |
|
primal slacks |
|
primal variables |
|
Lagrange multipliers for equality constraints |
|
Lagrange multipliers for inequality constraints |