#include <QpBoundData.h>
Inheritance diagram for QpBoundData:

Public Methods | |
| QpBoundData (QpBound *f, double alpha, OoqpVector *g, SymMatrix *Q, OoqpVector *l, OoqpVector *index_lower_, OoqpVector *u, OoqpVector *index_upper_) | |
| virtual double | objectiveValue (Variables *vars) |
| virtual void | putQIntoAt (SymMatrix &M, int row, int col) |
| virtual void | putQIntoAt (GenMatrix &M, int row, int col) |
| virtual void | Qmult (double beta, OoqpVector &y, double alpha, OoqpVector &x) |
| virtual int | getN () |
| virtual int | getNlower () |
| virtual int | getNupper () |
| virtual void | getg (OoqpVector &c) |
| virtual void | getl (OoqpVector &l) |
| virtual void | getu (OoqpVector &u) |
| virtual double | datanorm () |
| virtual void | datainput (MpsReader *reader, int &ierr) |
| virtual void | datarandom () |
| virtual void | print () |
| OoqpVector * | getIndexLower () |
| OoqpVector * | getIndexUpper () |
Protected Attributes | |
| int | nx |
| int | nlower |
| int | nupper |
| SymMatrixHandle | mQ |
| double | alpha |
| OoqpVectorHandle | c |
| OoqpVectorHandle | lower |
| OoqpVectorHandle | upper |
| OoqpVectorHandle | index_lower |
| OoqpVectorHandle | index_upper |
|
||||||||||||||||||||||||||||||||||||
|
constructor in which storage is allocated externally
|
|
||||||||||||
|
get problem data from a QPS file |
|
|
compute the norm of the problem data Implements Data. |
|
|
generate random problem data |
|
|
returns the linear term from objective function |
|
|
return indices of defined lower bounds |
|
|
return indices of defined upper bounds |
|
|
returns the vector of lower bounds |
|
|
return problem dimension |
|
|
returns the actual number of lower bounds |
|
|
returns the actual number of upper bounds |
|
|
returns the vector of upper bounds |
|
|
calculate objective function at given set of mariables |
|
|
print the problem data Implements Data. |
|
||||||||||||||||
|
stuff the Hessian into the coefficient matrix M of the linear system to be solved at each interior-point iteration. M is stored as a general matrix. |
|
||||||||||||||||
|
stuff the Hessian into the coefficient matrix M of the linear system to be solved at each interior-point iteration. M is stored as a symmetric matrix. |
|
||||||||||||||||||||
|
perform matrix-vector multiplication with the Hessian Q: y <- beta * y + alpha * Q * x |
|
|
scalar constant term in the obejctive |
|
|
linear term in the objective |
|
|
vector indicating locations of the finite components of the lower bound vector l |
|
|
vector indicating locations of the finite components of the upper bound vector l |
|
|
vector of lower bounds |
|
|
Hessian of the objective |
|
|
number of actual lower bound constraints |
|
|
number of actual upper bound constraints |
|
|
number of elements in x |
|
|
vector of upper bounds |
1.2.18