qpOASES
3.2.1
An Implementation of the Online Active Set Strategy
|
This is the complete list of members for QProblemB, including all inherited members.
addBound(int_t number, SubjectToStatus B_status, BooleanType updateCholesky) | QProblemB | private |
applyGivens(real_t c, real_t s, real_t nu, real_t xold, real_t yold, real_t &xnew, real_t &ynew) const | QProblemB | inlineprotected |
areBoundsConsistent(const real_t *const lb, const real_t *const ub) const | QProblemB | protected |
backsolveR(const real_t *const b, BooleanType transposed, real_t *const a) const | QProblemB | protectedvirtual |
backsolveR(const real_t *const b, BooleanType transposed, BooleanType removingBound, real_t *const a) const | QProblemB | protectedvirtual |
bounds | QProblemB | protected |
changeActiveSet(int_t BC_idx, SubjectToStatus BC_status) | QProblemB | private |
clear() | QProblemB | protected |
computeCholesky() | QProblemB | protectedvirtual |
computeGivens(real_t xold, real_t yold, real_t &xnew, real_t &ynew, real_t &c, real_t &s) const | QProblemB | inlineprotected |
copy(const QProblemB &rhs) | QProblemB | protected |
count | QProblemB | protected |
createDiagSparseMat(int_t n, real_t diagVal=1.0) | QProblemB | protected |
delta_xFR_TMP | QProblemB | protected |
determineDataShift(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, real_t *const delta_g, real_t *const delta_lb, real_t *const delta_ub, BooleanType &Delta_bB_isZero) | QProblemB | protected |
determineHessianType() | QProblemB | protected |
determineStepDirection(const real_t *const delta_g, const real_t *const delta_lb, const real_t *const delta_ub, BooleanType Delta_bB_isZero, real_t *const delta_xFX, real_t *const delta_xFR, real_t *const delta_yFX) | QProblemB | private |
flipper | QProblemB | protected |
freeHessian | QProblemB | protected |
g | QProblemB | protected |
getBounds(Bounds &_bounds) const | QProblemB | inline |
getCount() const | QProblemB | inline |
getDualSolution(real_t *const yOpt) const | QProblemB | virtual |
getHessianType() const | QProblemB | inline |
getNFR() const | QProblemB | inline |
getNFV() const | QProblemB | inline |
getNFX() const | QProblemB | inline |
getNV() const | QProblemB | inline |
getNZ() const | QProblemB | virtual |
getObjVal() const | QProblemB | |
getObjVal(const real_t *const _x) const | QProblemB | |
getOptions() const | QProblemB | inline |
getPrimalSolution(real_t *const xOpt) const | QProblemB | |
getPrintLevel() const | QProblemB | inline |
getRelativeHomotopyLength(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new) | QProblemB | protected |
getStatus() const | QProblemB | inline |
getWorkingSet(real_t *workingSet) | QProblemB | virtual |
getWorkingSetBounds(real_t *workingSetB) | QProblemB | virtual |
getWorkingSetConstraints(real_t *workingSetC) | QProblemB | virtual |
H | QProblemB | protected |
haveCholesky | QProblemB | protected |
hessianType | QProblemB | protected |
hotstart(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, int_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0) | QProblemB | |
hotstart(const char *const g_file, const char *const lb_file, const char *const ub_file, int_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0) | QProblemB | |
infeasible | QProblemB | protected |
init(SymmetricMatrix *_H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub, int_t &nWSR, real_t *const cputime=0, const real_t *const xOpt=0, const real_t *const yOpt=0, const Bounds *const guessedBounds=0, const real_t *const _R=0) | QProblemB | |
init(const real_t *const _H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub, int_t &nWSR, real_t *const cputime=0, const real_t *const xOpt=0, const real_t *const yOpt=0, const Bounds *const guessedBounds=0, const real_t *const _R=0) | QProblemB | |
init(const char *const H_file, const char *const g_file, const char *const lb_file, const char *const ub_file, int_t &nWSR, real_t *const cputime=0, const real_t *const xOpt=0, const real_t *const yOpt=0, const Bounds *const guessedBounds=0, const char *const R_file=0) | QProblemB | |
isBlocking(real_t num, real_t den, real_t epsNum, real_t epsDen, real_t &t) const | QProblemB | inlineprotected |
isCPUtimeLimitExceeded(const real_t *const cputime, real_t starttime, int_t nWSR) const | QProblemB | protected |
isInfeasible() const | QProblemB | inline |
isInitialised() const | QProblemB | inline |
isSolved() const | QProblemB | inline |
isUnbounded() const | QProblemB | inline |
lb | QProblemB | protected |
loadQPvectorsFromFile(const char *const g_file, const char *const lb_file, const char *const ub_file, real_t *const g_new, real_t *const lb_new, real_t *const ub_new) const | QProblemB | protected |
obtainAuxiliaryWorkingSet(const real_t *const xOpt, const real_t *const yOpt, const Bounds *const guessedBounds, Bounds *auxiliaryBounds) const | QProblemB | protected |
operator=(const QProblemB &rhs) | QProblemB | virtual |
options | QProblemB | protected |
performDriftCorrection() | QProblemB | privatevirtual |
performRamping() | QProblemB | protectedvirtual |
performRatioTest(int_t nIdx, const int_t *const idxList, const SubjectTo *const subjectTo, const real_t *const num, const real_t *const den, real_t epsNum, real_t epsDen, real_t &t, int_t &BC_idx) const | QProblemB | protected |
performStep(const real_t *const delta_g, const real_t *const delta_lb, const real_t *const delta_ub, const real_t *const delta_xFX, const real_t *const delta_xFR, const real_t *const delta_yFX, int_t &BC_idx, SubjectToStatus &BC_status) | QProblemB | private |
printIteration(int_t iter, int_t BC_idx, SubjectToStatus BC_status, real_t homotopyLength, BooleanType isFirstCall=BT_TRUE) | QProblemB | private |
printOptions() const | QProblemB | |
printProperties() | QProblemB | virtual |
QProblemB() | QProblemB | |
QProblemB(int_t _nV, HessianType _hessianType=HST_UNKNOWN, BooleanType allocDenseMats=BT_TRUE) | QProblemB | |
QProblemB(const QProblemB &rhs) | QProblemB | |
R | QProblemB | protected |
ramp0 | QProblemB | protected |
ramp1 | QProblemB | protected |
rampOffset | QProblemB | protected |
regulariseHessian() | QProblemB | protected |
regVal | QProblemB | protected |
removeBound(int_t number, BooleanType updateCholesky) | QProblemB | private |
reset() | QProblemB | virtual |
resetCounter() | QProblemB | inline |
setG(const real_t *const g_new) | QProblemB | inlineprotected |
setH(SymmetricMatrix *H_new) | QProblemB | inlineprotected |
setH(const real_t *const H_new) | QProblemB | inlineprotected |
setHessianType(HessianType _hessianType) | QProblemB | inline |
setInfeasibilityFlag(returnValue returnvalue, BooleanType doThrowError=BT_FALSE) | QProblemB | protected |
setLB(const real_t *const lb_new) | QProblemB | inlineprotected |
setLB(int_t number, real_t value) | QProblemB | inlineprotected |
setOptions(const Options &_options) | QProblemB | inline |
setPrintLevel(PrintLevel _printlevel) | QProblemB | |
setUB(const real_t *const ub_new) | QProblemB | inlineprotected |
setUB(int_t number, real_t value) | QProblemB | inlineprotected |
setupAuxiliaryQP(const Bounds *const guessedBounds) | QProblemB | protectedvirtual |
setupAuxiliaryQPbounds(BooleanType useRelaxation) | QProblemB | private |
setupAuxiliaryQPgradient() | QProblemB | private |
setupAuxiliaryQPsolution(const real_t *const xOpt, const real_t *const yOpt) | QProblemB | private |
setupAuxiliaryWorkingSet(const Bounds *const auxiliaryBounds, BooleanType setupAfresh) | QProblemB | private |
setupInitialCholesky() | QProblemB | protectedvirtual |
setupQPdata(SymmetricMatrix *_H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub) | QProblemB | protected |
setupQPdata(const real_t *const _H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub) | QProblemB | protected |
setupQPdataFromFile(const char *const H_file, const char *const g_file, const char *const lb_file, const char *const ub_file) | QProblemB | protected |
setupSubjectToType() | QProblemB | protectedvirtual |
setupSubjectToType(const real_t *const lb_new, const real_t *const ub_new) | QProblemB | protectedvirtual |
shallRefactorise(const Bounds *const guessedBounds) const | QProblemB | private |
SolutionAnalysis (defined in QProblemB) | QProblemB | friend |
solveInitialQP(const real_t *const xOpt, const real_t *const yOpt, const Bounds *const guessedBounds, const real_t *const _R, int_t &nWSR, real_t *const cputime) | QProblemB | private |
solveQP(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, int_t &nWSR, real_t *const cputime, int_t nWSRperformed=0, BooleanType isFirstCall=BT_TRUE) | QProblemB | private |
solveRegularisedQP(const real_t *const g_new, const real_t *const lb_new, const real_t *const ub_new, int_t &nWSR, real_t *const cputime, int_t nWSRperformed=0, BooleanType isFirstCall=BT_TRUE) | QProblemB | private |
status | QProblemB | protected |
tabularOutput | QProblemB | protected |
tau | QProblemB | protected |
ub | QProblemB | protected |
unbounded | QProblemB | protected |
updateFarBounds(real_t curFarBound, int_t nRamp, const real_t *const lb_new, real_t *const lb_new_far, const real_t *const ub_new, real_t *const ub_new_far) const | QProblemB | protected |
usingRegularisation() const | QProblemB | inline |
x | QProblemB | protected |
y | QProblemB | protected |
~QProblemB() | QProblemB | virtual |