qpOASES  3.2.1
An Implementation of the Online Active Set Strategy
SQProblem Member List
This is the complete list of members for SQProblem, including all inherited members.
AQProblem [protected]
addBound(int_t number, SubjectToStatus B_status, BooleanType updateCholesky, BooleanType ensureLI=BT_TRUE)QProblem [protected, virtual]
addBound_checkLI(int_t number)QProblem [protected, virtual]
addBound_ensureLI(int_t number, SubjectToStatus B_status)QProblem [protected, virtual]
addConstraint(int_t number, SubjectToStatus C_status, BooleanType updateCholesky, BooleanType ensureLI=BT_TRUE)QProblem [protected, virtual]
addConstraint_checkLI(int_t number)QProblem [protected, virtual]
addConstraint_ensureLI(int_t number, SubjectToStatus C_status)QProblem [protected, virtual]
applyGivens(real_t c, real_t s, real_t nu, real_t xold, real_t yold, real_t &xnew, real_t &ynew) const QProblemB [inline, protected]
areBoundsConsistent(const real_t *const lb, const real_t *const ub, const real_t *const lbA, const real_t *const ubA) const QProblem [protected]
QProblemB::areBoundsConsistent(const real_t *const lb, const real_t *const ub) const QProblemB [protected]
AxQProblem [protected]
Ax_lQProblem [protected]
Ax_uQProblem [protected]
backsolveR(const real_t *const b, BooleanType transposed, real_t *const a) const QProblemB [protected, virtual]
backsolveR(const real_t *const b, BooleanType transposed, BooleanType removingBound, real_t *const a) const QProblemB [protected, virtual]
backsolveT(const real_t *const b, BooleanType transposed, real_t *const a) const QProblem [protected, virtual]
boundsQProblemB [protected]
changeActiveSet(int_t BC_idx, SubjectToStatus BC_status, BooleanType BC_isBound)QProblem [protected]
clear()QProblem [protected]
computeCholesky()QProblemB [protected, virtual]
computeGivens(real_t xold, real_t yold, real_t &xnew, real_t &ynew, real_t &c, real_t &s) const QProblemB [inline, protected]
computeProjectedCholesky()QProblem [protected, virtual]
constraintProductQProblem [protected]
constraintsQProblem [protected]
copy(const QProblem &rhs)QProblem [protected]
QProblemB::copy(const QProblemB &rhs)QProblemB [protected]
countQProblemB [protected]
createDiagSparseMat(int_t n, real_t diagVal=1.0)QProblemB [protected]
delta_xFR_TMPQProblemB [protected]
delta_xFRyQProblem [protected]
delta_xFRzQProblem [protected]
delta_yAC_TMPQProblem [protected]
determineDataShift(const real_t *const g_new, const real_t *const lbA_new, const real_t *const ubA_new, const real_t *const lb_new, const real_t *const ub_new, real_t *const delta_g, real_t *const delta_lbA, real_t *const delta_ubA, real_t *const delta_lb, real_t *const delta_ub, BooleanType &Delta_bC_isZero, BooleanType &Delta_bB_isZero)QProblem [protected]
QProblemB::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_lbA, const real_t *const delta_ubA, const real_t *const delta_lb, const real_t *const delta_ub, BooleanType Delta_bC_isZero, BooleanType Delta_bB_isZero, real_t *const delta_xFX, real_t *const delta_xFR, real_t *const delta_yAC, real_t *const delta_yFX)QProblem [protected, virtual]
dropInfeasibles(int_t BC_number, SubjectToStatus BC_status, BooleanType BC_isBound, real_t *xiB, real_t *xiC)QProblem [protected]
ensureNonzeroCurvature(BooleanType removeBoundNotConstraint, int_t remIdx, BooleanType &exchangeHappened, BooleanType &addBoundNotConstraint, int_t &addIdx, SubjectToStatus &addStatus)QProblem [protected]
flipperQProblemB [protected]
freeConstraintMatrixQProblem [protected]
freeHessianQProblemB [protected]
gQProblemB [protected]
getBounds(Bounds &_bounds) const QProblemB [inline]
getConstraints(Constraints &_constraints) const QProblem [inline]
getCount() const QProblemB [inline]
getDualSolution(real_t *const yOpt) const QProblem [virtual]
getFreeVariablesFlags(BooleanType *varIsFree)QProblem
getHessianType() const QProblemB [inline]
getNAC() const QProblem [inline]
getNC() const QProblem [inline]
getNEC() const QProblem [inline]
getNFR() const QProblemB [inline]
getNFV() const QProblemB [inline]
getNFX() const QProblemB [inline]
getNIAC() const QProblem [inline]
getNV() const QProblemB [inline]
getNZ() const QProblem [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, const real_t *const lbA_new, const real_t *const ubA_new)QProblem [protected]
QProblemB::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)QProblem [virtual]
getWorkingSetBounds(real_t *workingSetB)QProblem [virtual]
getWorkingSetConstraints(real_t *workingSetC)QProblem [virtual]
HQProblemB [protected]
haveCholeskyQProblemB [protected]
hessianTypeQProblemB [protected]
hotstart(SymmetricMatrix *H_new, const real_t *const g_new, Matrix *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_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0, const Constraints *const guessedConstraints=0)SQProblem
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_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0, const Constraints *const guessedConstraints=0)SQProblem
hotstart(const char *const H_file, const char *const g_file, const char *const A_file, const char *const lb_file, const char *const ub_file, const char *const lbA_file, const char *const ubA_file, int_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0, const Constraints *const guessedConstraints=0)SQProblem
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_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0, const Constraints *const guessedConstraints=0)SQProblem
hotstart(const char *const g_file, const char *const lb_file, const char *const ub_file, const char *const lbA_file, const char *const ubA_file, int_t &nWSR, real_t *const cputime=0, const Bounds *const guessedBounds=0, const Constraints *const guessedConstraints=0)SQProblem
QProblemB::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
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
infeasibleQProblemB [protected]
init(SymmetricMatrix *_H, const real_t *const _g, Matrix *_A, const real_t *const _lb, const real_t *const _ub, const real_t *const _lbA, const real_t *const _ubA, 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 Constraints *const guessedConstraints=0, const real_t *const _R=0)QProblem
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_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 Constraints *const guessedConstraints=0, const real_t *const _R=0)QProblem
init(const char *const H_file, const char *const g_file, const char *const A_file, const char *const lb_file, const char *const ub_file, const char *const lbA_file, const char *const ubA_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 Constraints *const guessedConstraints=0, const char *const R_file=0)QProblem
QProblemB::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
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
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 [inline, protected]
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]
lbQProblemB [protected]
lbAQProblem [protected]
loadQPvectorsFromFile(const char *const g_file, const char *const lb_file, const char *const ub_file, const char *const lbA_file, const char *const ubA_file, real_t *const g_new, real_t *const lb_new, real_t *const ub_new, real_t *const lbA_new, real_t *const ubA_new) const QProblem [protected]
QProblemB::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, const Constraints *const guessedConstraints, Bounds *auxiliaryBounds, Constraints *auxiliaryConstraints) const QProblem [protected]
QProblemB::obtainAuxiliaryWorkingSet(const real_t *const xOpt, const real_t *const yOpt, const Bounds *const guessedBounds, Bounds *auxiliaryBounds) const QProblemB [protected]
operator=(const SQProblem &rhs)SQProblem [virtual]
QProblem::operator=(const QProblem &rhs)QProblem [virtual]
QProblemB::operator=(const QProblemB &rhs)QProblemB [virtual]
optionsQProblemB [protected]
performDriftCorrection()QProblem [protected, virtual]
performPlainRatioTest(int_t nIdx, const int_t *const idxList, const real_t *const num, const real_t *const den, real_t epsNum, real_t epsDen, real_t &t, int_t &BC_idx) const QProblem [protected]
performRamping()QProblem [protected, virtual]
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_lbA, const real_t *const delta_ubA, 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_yAC, const real_t *const delta_yFX, int_t &BC_idx, SubjectToStatus &BC_status, BooleanType &BC_isBound)QProblem [protected]
printIteration(int_t iter, int_t BC_idx, SubjectToStatus BC_status, BooleanType BC_isBound, real_t homotopyLength, BooleanType isFirstCall=BT_TRUE)QProblem [protected]
printOptions() const QProblemB
printProperties()QProblem [virtual]
QQProblem [protected]
QProblem()QProblem
QProblem(int_t _nV, int_t _nC, HessianType _hessianType=HST_UNKNOWN, BooleanType allocDenseMats=BT_TRUE)QProblem
QProblem(const QProblem &rhs)QProblem
QProblemB()QProblemB
QProblemB(int_t _nV, HessianType _hessianType=HST_UNKNOWN, BooleanType allocDenseMats=BT_TRUE)QProblemB
QProblemB(const QProblemB &rhs)QProblemB
RQProblemB [protected]
ramp0QProblemB [protected]
ramp1QProblemB [protected]
rampOffsetQProblemB [protected]
regulariseHessian()QProblemB [protected]
regValQProblemB [protected]
removeBound(int_t number, BooleanType updateCholesky, BooleanType allowFlipping=BT_FALSE, BooleanType ensureNZC=BT_FALSE)QProblem [protected, virtual]
removeConstraint(int_t number, BooleanType updateCholesky, BooleanType allowFlipping=BT_FALSE, BooleanType ensureNZC=BT_FALSE)QProblem [protected, virtual]
reset()QProblem [virtual]
resetCounter()QProblemB [inline]
setA(Matrix *A_new)QProblem [inline, protected]
setA(const real_t *const A_new)QProblem [inline, protected]
setConstraintProduct(ConstraintProduct *const _constraintProduct)QProblem
setG(const real_t *const g_new)QProblemB [inline, protected]
setH(SymmetricMatrix *H_new)QProblemB [inline, protected]
setH(const real_t *const H_new)QProblemB [inline, protected]
setHessianType(HessianType _hessianType)QProblemB [inline]
setInfeasibilityFlag(returnValue returnvalue, BooleanType doThrowError=BT_FALSE)QProblemB [protected]
setLB(const real_t *const lb_new)QProblemB [inline, protected]
setLB(int_t number, real_t value)QProblemB [inline, protected]
setLBA(const real_t *const lbA_new)QProblem [inline, protected]
setLBA(int_t number, real_t value)QProblem [inline, protected]
setOptions(const Options &_options)QProblemB [inline]
setPrintLevel(PrintLevel _printlevel)QProblemB
setUB(const real_t *const ub_new)QProblemB [inline, protected]
setUB(int_t number, real_t value)QProblemB [inline, protected]
setUBA(const real_t *const ubA_new)QProblem [inline, protected]
setUBA(int_t number, real_t value)QProblem [inline, protected]
setupAuxiliaryQP(const Bounds *const guessedBounds, const Constraints *const guessedConstraints)QProblem [protected, virtual]
QProblemB::setupAuxiliaryQP(const Bounds *const guessedBounds)QProblemB [protected, virtual]
setupAuxiliaryQPbounds(const Bounds *const auxiliaryBounds, const Constraints *const auxiliaryConstraints, BooleanType useRelaxation)QProblem [protected]
setupAuxiliaryQPgradient()QProblem [protected]
setupAuxiliaryQPsolution(const real_t *const xOpt, const real_t *const yOpt)QProblem [protected]
setupAuxiliaryWorkingSet(const Bounds *const auxiliaryBounds, const Constraints *const auxiliaryConstraints, BooleanType setupAfresh)QProblem [protected, virtual]
setupInitialCholesky()QProblem [protected, virtual]
setupNewAuxiliaryQP(SymmetricMatrix *H_new, Matrix *A_new, const real_t *lb_new, const real_t *ub_new, const real_t *lbA_new, const real_t *ubA_new)SQProblem [protected, virtual]
setupNewAuxiliaryQP(const real_t *const H_new, const real_t *const A_new, const real_t *lb_new, const real_t *ub_new, const real_t *lbA_new, const real_t *ubA_new)SQProblem [protected, virtual]
setupQPdata(SymmetricMatrix *_H, const real_t *const _g, Matrix *_A, const real_t *const _lb, const real_t *const _ub, const real_t *const _lbA, const real_t *const _ubA)QProblem [protected]
setupQPdata(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)QProblem [protected]
QProblemB::setupQPdata(SymmetricMatrix *_H, const real_t *const _g, const real_t *const _lb, const real_t *const _ub)QProblemB [protected]
QProblemB::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 A_file, const char *const lb_file, const char *const ub_file, const char *const lbA_file, const char *const ubA_file)QProblem [protected]
QProblemB::setupQPdataFromFile(const char *const H_file, const char *const g_file, const char *const lb_file, const char *const ub_file)QProblemB [protected]
setupSubjectToType()QProblem [protected, virtual]
setupSubjectToType(const real_t *const lb_new, const real_t *const ub_new, const real_t *const lbA_new, const real_t *const ubA_new)QProblem [protected, virtual]
QProblemB::setupSubjectToType(const real_t *const lb_new, const real_t *const ub_new)QProblemB [protected, virtual]
setupTQfactorisation()QProblem [protected, virtual]
shallRefactorise(const Bounds *const guessedBounds, const Constraints *const guessedConstraints) const QProblem [protected]
sizeTQProblem [protected]
SolutionAnalysis (defined in SQProblem)SQProblem [friend]
solveCurrentEQP(const int_t n_rhs, const real_t *g_in, const real_t *lb_in, const real_t *ub_in, const real_t *lbA_in, const real_t *ubA_in, real_t *x_out, real_t *y_out)QProblem
solveInitialQP(const real_t *const xOpt, const real_t *const yOpt, const Bounds *const guessedBounds, const Constraints *const guessedConstraints, const real_t *const _R, int_t &nWSR, real_t *const cputime)QProblem [protected]
solveQP(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_t &nWSR, real_t *const cputime, int_t nWSRperformed=0, BooleanType isFirstCall=BT_TRUE)QProblem [protected]
solveRegularisedQP(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_t &nWSR, real_t *const cputime, int_t nWSRperformed=0, BooleanType isFirstCall=BT_TRUE)QProblem [protected]
SQProblem()SQProblem
SQProblem(int_t _nV, int_t _nC, HessianType _hessianType=HST_UNKNOWN, BooleanType allocDenseMats=BT_TRUE)SQProblem
SQProblem(const SQProblem &rhs)SQProblem
statusQProblemB [protected]
TQProblem [protected]
tabularOutputQProblemB [protected]
tauQProblemB [protected]
tempAQProblem [protected]
tempBQProblem [protected]
tempCQProblem [protected]
ubQProblemB [protected]
ubAQProblem [protected]
unboundedQProblemB [protected]
updateActivitiesForHotstart(const real_t *const lb_new, const real_t *const ub_new, const real_t *const lbA_new, const real_t *const ubA_new)QProblem [protected, virtual]
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 real_t *const lbA_new, real_t *const lbA_new_far, const real_t *const ubA_new, real_t *const ubA_new_far) const QProblem [protected]
QProblemB::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]
writeQpDataIntoMatFile(const char *const filename) const QProblem
writeQpWorkspaceIntoMatFile(const char *const filename)QProblem
xQProblemB [protected]
yQProblemB [protected]
ZFR_delta_xFRzQProblem [protected]
~QProblem()QProblem [virtual]
~QProblemB()QProblemB [virtual]
~SQProblem()SQProblem [virtual]