|
eiquadprog 1.3.2
C++ reimplementation of eiquadprog
|
#include <eiquadprog/eiquadprog-fast.hpp>
Public Member Functions | |
| EIGEN_MAKE_ALIGNED_OPERATOR_NEW | EiquadprogFast () |
| virtual | ~EiquadprogFast () |
| void | reset (size_t dim_qp, size_t num_eq, size_t num_ineq) |
| int | getMaxIter () const |
| bool | setMaxIter (int maxIter) |
| size_t | getActiveSetSize () const |
| int | getIteratios () const |
| double | getObjValue () const |
| const VectorXd & | getLagrangeMultipliers () const |
| const VectorXi & | getActiveSet () const |
| EiquadprogFast_status | solve_quadprog (const MatrixXd &Hess, const VectorXd &g0, const MatrixXd &CE, const VectorXd &ce0, const MatrixXd &CI, const VectorXd &ci0, VectorXd &x) |
Public Attributes | |
| MatrixXd | m_J |
| bool | is_inverse_provided_ |
| eiquadprog::solvers::EiquadprogFast::EiquadprogFast | ( | ) |
|
virtual |
|
inline |
Return the active set, namely the indeces of active constraints. The first nEqCon indexes are for the equalities and are negative. The last nIneqCon indexes are for the inequalities and start from 0. Only the first q elements of the return vector are valid, where q is the size of the active set.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
| void eiquadprog::solvers::EiquadprogFast::reset | ( | size_t | dim_qp, |
| size_t | num_eq, | ||
| size_t | num_ineq ) |
|
inline |
| EiquadprogFast_status eiquadprog::solvers::EiquadprogFast::solve_quadprog | ( | const MatrixXd & | Hess, |
| const VectorXd & | g0, | ||
| const MatrixXd & | CE, | ||
| const VectorXd & | ce0, | ||
| const MatrixXd & | CI, | ||
| const VectorXd & | ci0, | ||
| VectorXd & | x ) |
solves the problem min. x' Hess x + 2 g0' x s.t. CE x + ce0 = 0 CI x + ci0 >= 0
| bool eiquadprog::solvers::EiquadprogFast::is_inverse_provided_ |
| MatrixXd eiquadprog::solvers::EiquadprogFast::m_J |