#include <tsid/solvers/solver-HQP-eiquadprog-rt.hpp>
|
void | sendMsg (const std::string &s) |
|
◆ ConstRefMatrix
template<int nVars, int nEqCon, int nIneqCon>
◆ ConstRefVector
template<int nVars, int nEqCon, int nIneqCon>
◆ RefVector
template<int nVars, int nEqCon, int nIneqCon>
◆ Vector
template<int nVars, int nEqCon, int nIneqCon>
◆ SolverHQuadProgRT()
template<int nVars, int nEqCon, int nIneqCon>
◆ getObjectiveValue()
template<int nVars, int nEqCon, int nIneqCon>
◆ resize()
template<int nVars, int nEqCon, int nIneqCon>
◆ sendMsg()
template<int nVars, int nEqCon, int nIneqCon>
◆ setMaximumIterations()
template<int nVars, int nEqCon, int nIneqCon>
◆ solve()
template<int nVars, int nEqCon, int nIneqCon>
◆ m_activeSet
template<int nVars, int nEqCon, int nIneqCon>
◆ m_activeSetSize
template<int nVars, int nEqCon, int nIneqCon>
vector containing the indexes of the active inequalities
◆ m_CE
template<int nVars, int nEqCon, int nIneqCon>
◆ m_ce0
template<int nVars, int nEqCon, int nIneqCon>
◆ m_CI
template<int nVars, int nEqCon, int nIneqCon>
◆ m_ci0
template<int nVars, int nEqCon, int nIneqCon>
twice the rows because inequality constraints are bilateral
◆ m_g
template<int nVars, int nEqCon, int nIneqCon>
◆ m_H
template<int nVars, int nEqCon, int nIneqCon>
◆ m_hessian_regularization
template<int nVars, int nEqCon, int nIneqCon>
◆ m_n
template<int nVars, int nEqCon, int nIneqCon>
number of inequality constraints
◆ m_neq
template<int nVars, int nEqCon, int nIneqCon>
◆ m_nin
template<int nVars, int nEqCon, int nIneqCon>
number of equality constraints
◆ m_objValue
template<int nVars, int nEqCon, int nIneqCon>
◆ m_solver
template<int nVars, int nEqCon, int nIneqCon>
◆ Matrix
template<int nVars, int nEqCon, int nIneqCon>
The documentation for this class was generated from the following files: