38 #include <scilab/Scierror.h> 40 #include <qpOASES.hpp> 105 for( i=0; i<nV*nC; ++i )
108 for( i=0; i<nC; ++i )
109 for( j=0; j<nV; ++j )
110 A[i*nV + j] = A_tmp[j*nC + i];
132 returnValue returnvalue = single_qp.
init( H,g,A,lb,ub,lbA,ubA, *nWSR,0 );
241 Scierror( 999,
"ERROR (qpOASES): Need to call qpOASES_init first!\n" );
271 Scierror( 999,
"ERROR (qpOASES): Need to call qpOASES_initSB first!\n" );
301 Scierror( 999,
"ERROR (qpOASES): Need to call qpOASES_initVM first!\n" );
returnValue getPrimalSolution(real_t *const xOpt) const
#define USING_NAMESPACE_QPOASES
void sci_SQProblem_cleanup()
returnValue init(const real_t *const _H, const real_t *const _g, const real_t *const _A, const real_t *const _lb, const real_t *const _ub, const real_t *const _lbA, const real_t *const _ubA, int &nWSR, const real_t *const yOpt=0, real_t *const cputime=0)
void sci_SQProblem_init(real_t *H, real_t *g, real_t *A, real_t *lb, real_t *ub, real_t *lbA, real_t *ubA, int_t *nV, int_t *nC, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
static USING_NAMESPACE_QPOASES QProblem * qp
Implements the online active set strategy for box-constrained QPs.
void sci_QProblemB_cleanup()
Implements the online active set strategy for QPs with varying matrices.
Allows to pass back messages to the calling function.
void sci_SQProblem_hotstart(real_t *H, real_t *g, real_t *A, real_t *lb, real_t *ub, real_t *lbA, real_t *ubA, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
returnValue init(const real_t *const _H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub, int &nWSR, const real_t *const yOpt=0, real_t *const cputime=0)
returnValue hotstart(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, const real_t *const lbA_new, const real_t *const ubA_new, int &nWSR, real_t *const cputime)
void sci_qpOASES(real_t *H, real_t *g, real_t *A, real_t *lb, real_t *ub, real_t *lbA, real_t *ubA, int_t *nV, int_t *nC, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
returnValue hotstart(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, int &nWSR, real_t *const cputime)
returnValue getDualSolution(real_t *const yOpt) const
void sci_QProblemB_init(real_t *H, real_t *g, real_t *lb, real_t *ub, int_t *nV, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
void sci_QProblem_cleanup()
void transformA(real_t *A, int_t nV, int_t nC)
void sci_QProblemB_hotstart(real_t *g, real_t *lb, real_t *ub, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
void sci_QProblem_hotstart(real_t *g, real_t *lb, real_t *ub, real_t *lbA, real_t *ubA, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
int_t getSimpleStatus(returnValue returnvalue, BooleanType doPrintStatus=BT_FALSE)
Implements the online active set strategy for QPs with general constraints.
void sci_QProblem_init(real_t *H, real_t *g, real_t *A, real_t *lb, real_t *ub, real_t *lbA, real_t *ubA, int_t *nV, int_t *nC, int_t *nWSR, real_t *x, real_t *obj, int_t *status, int_t *nWSRout, real_t *y)
returnValue setPrintLevel(PrintLevel _printlevel)
returnValue hotstart(const real_t *const H_new, const real_t *const g_new, const real_t *const A_new, const real_t *const lb_new, const real_t *const ub_new, const real_t *const lbA_new, const real_t *const ubA_new, int &nWSR, real_t *const cputime)
returnValue getDualSolution(real_t *const yOpt) const