qpSWIFT
A Sparse Quadratic Programming Solver
|
#include <Auxilary.h>
Data Fields | |
smat * | kktmatrix |
qp_real * | b |
qp_int * | Parent |
qp_int * | Flag |
qp_int * | Lnz |
qp_int * | Li |
qp_int * | Lp |
qp_int * | Lti |
qp_int * | Ltp |
qp_int * | Pattern |
qp_int * | UPattern |
qp_real * | Y |
qp_real * | Lx |
qp_real * | D |
qp_int * | P |
qp_int * | Pinv |
smat | kktmatrix |
qp_real | b |
qp_int | Parent [n] |
qp_int | Flag [n] |
qp_int | Lnz [n] |
qp_int | Li [lnz+1] |
qp_int | Lp |
qp_int | Lti [lnz] |
qp_int | Ltp [n+1] |
qp_int | Pattern [n] |
qp_int | UPattern [n] |
qp_real | Y [n] |
qp_real | Lx [lnz+1] |
qp_real | D [n] |
qp_int | P [n] |
qp_int | Pinv [n] |
KKT Structure
Used to store everything related to KKT matrix and its factorization
qp_real kkt::b |
b vector
qp_real * kkt::b |
b vector
qp_real kkt::D[n] |
LDL - workspace Vectors
qp_real * kkt::D |
LDL - workspace Vectors
qp_int kkt::Flag[n] |
LDL - workspace Vectors
qp_int * kkt::Flag |
LDL - workspace Vectors
smat kkt::kktmatrix |
Sparse kkt matrix
smat * kkt::kktmatrix |
Sparse kkt matrix
qp_int kkt::Li[lnz+1] |
ir vector of LDL Sparse Matrix in column compressed format
qp_int * kkt::Li |
ir vector of LDL Sparse Matrix in column compressed format
qp_int kkt::Lnz[n] |
LDL - workspace Vectors
qp_int * kkt::Lnz |
LDL - workspace Vectors
qp_int kkt::Lp |
jc vector of LDL Sparse Matrix in column compressed format
qp_int * kkt::Lp |
jc vector of LDL Sparse Matrix in column compressed format
qp_int kkt::Lti[lnz] |
ir vector of the transpose of LDL Sparse Matrix in column compressed format
qp_int * kkt::Lti |
ir vector of the transpose of LDL Sparse Matrix in column compressed format
qp_int kkt::Ltp[n+1] |
jc vector of the transpose of LDL Sparse Matrix in column compressed format
qp_int * kkt::Ltp |
jc vector of the transpose of LDL Sparse Matrix in column compressed format
qp_real kkt::Lx[lnz+1] |
pr vector of LDL Sparse Matrix in column compressed format
qp_real * kkt::Lx |
pr vector of LDL Sparse Matrix in column compressed format
qp_int kkt::P[n] |
Permutation Vector ; Input
qp_int * kkt::P |
Permutation Vector ; Input
qp_int kkt::Parent[n] |
LDL - workspace Vectors
qp_int * kkt::Parent |
LDL - workspace Vectors
qp_int kkt::Pattern[n] |
LDL - workspace Vectors
qp_int * kkt::Pattern |
LDL - workspace Vectors
qp_int kkt::Pinv[n] |
Permutation Vector Inverse
qp_int * kkt::Pinv |
Permutation Vector Inverse
qp_int kkt::UPattern[n] |
Nodes to be updated during every iteration
qp_int * kkt::UPattern |
Nodes to be updated during every iteration
qp_real kkt::Y[n] |
LDL - workspace Vectors
qp_real * kkt::Y |
LDL - workspace Vectors