DuQuad
v1.0
Quadratic Programming Optimizations
|
#include <qp_structs.h>
Data Fields | |
real_t * | H |
real_t * | c |
real_t * | A |
real_t * | A_t |
real_t * | b |
real_t * | lb_hat |
real_t * | ub_hat |
real_t * | lb |
real_t * | ub |
real_t * | z0 |
Contains all the matrices and vectors used to describe the general QP
Definition at line 15 of file qp_structs.h.
real_t* Problem::A |
Linear constraints matrix Dimensions m x n
Definition at line 18 of file qp_structs.h.
real_t* Problem::A_t |
A transposed
Definition at line 19 of file qp_structs.h.
real_t* Problem::b |
Linear constraints vector
Definition at line 20 of file qp_structs.h.
real_t* Problem::c |
The gradient vector
Definition at line 17 of file qp_structs.h.
real_t* Problem::H |
The Hessian matrix. Dimensions n x n, and has to be positive definite
Definition at line 16 of file qp_structs.h.
real_t* Problem::lb |
The lower bound for optimization variable z
Definition at line 23 of file qp_structs.h.
real_t* Problem::lb_hat |
The lower bound for the linear constraints
Definition at line 21 of file qp_structs.h.
real_t* Problem::ub |
The upper bound for optimization variable z
Definition at line 24 of file qp_structs.h.
real_t* Problem::ub_hat |
The upper bound for the linear constraints
Definition at line 22 of file qp_structs.h.
real_t* Problem::z0 |
The initial point
Definition at line 25 of file qp_structs.h.