|
Minotaur 0.4.1
Docs for developers
|
Information for restarting from the previous optimal solution. More...
#include <BqpdEngine.h>
Public Member Functions | |
| BqpdData (UInt n_t, UInt m_t, int kmax_t, UInt maxa_t, UInt lh1_t, UInt nJac, bool zero=true) | |
| Constructor. | |
| ~BqpdData () | |
| Destroy. | |
| BqpdData * | clone () |
| Allocate space and copy. | |
| void | copyFrom (const BqpdData *rhs) |
| Only copy. No space allocation. | |
| void | write (std::ostream &out) const |
| Display all data. | |
Public Attributes | |
| UInt | n |
| Number of variables. | |
| UInt | m |
| Number of constraints. | |
| int | kmax |
| kmax given to bqpd | |
| UInt | lh1 |
| Number of nonzeros in Hessian. | |
| UInt | nJac |
| Number of nonzeros in Jacobian. | |
| UInt | maxa |
| Size of a. | |
| double * | x |
| Initial point for solving QP. | |
| double * | r |
| Residuals/multipliers. | |
| double * | e |
| Steepest-edge normalization coefficients . | |
| double * | w |
| Denominators for ratio tests. | |
| double * | g |
| Gradient vector of f(x). | |
| int * | ls |
| Indices of the active constraints . | |
| double * | alp |
| Workspace associated with recursion. | |
| int * | lp |
| Workspace associated with recursion. | |
| int * | info |
| Information on return from bqpd. | |
| double * | bl |
| Lower bounds for variables and constraints. | |
| double * | bu |
| Upper bounds for variables and constraints. | |
| double * | a |
| Storage for jacobian. | |
| int * | la |
| Storage for jacobian. | |
| double * | ws |
| Storage for hessian values and other things. | |
| int * | lws |
| Storage for hessian indices and other things. | |
| int | peq |
| Pointer to equality constraints, used by bqpd. | |
| int | k |
Information for restarting from the previous optimal solution.