| active_set_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| checkConstraintViolation(const MatrixIndex i, const double lb_i, const double ub_i, const double ctr_i_dot_primal) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| chooseConstraint(const t_Primal &primal, const t_LowerBounds &lb, const t_UpperBounds &ub, const t_Constraints &A, const t_ConstraintsLowerBounds &Alb, const t_ConstraintsUpperBounds &Aub, const double tolerance) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| chosen_ctr_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| constraints_status_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| dual_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| dual_step_direction_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| factorization_data_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| factorizeCholeskyInPlace(Eigen::Matrix< t_Scalar, t_Other... > &H) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivatestatic |
| factorizeCholeskyInPlace(MatrixRef &H) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivatestatic |
| factorizeCholeskyInPlace(Eigen::SparseMatrix< t_Scalar, t_Options, t_StorageIndex > &H) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivatestatic |
| general_ctr_dot_primal_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| getConstraintDotPrimalStepDirection(const t_VectorType &primal_step_direction, const t_MatrixType &A) const | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| getHessianType() const | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inline |
| getInequalityDual(Vector< t_dual_size > &dual, Eigen::Matrix< MatrixIndex, t_index_size, 1 > &indices, Eigen::Matrix< bool, t_status_size, 1 > &is_lower) const | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inline |
| getNumberOfInequalityIterations() const | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inline |
| h_size_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| hessian_type_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| initializeMachineryLazy(t_MatrixType &H, const bool return_inverted_cholesky_factor) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| iter_counter_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| machinery_initialized_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| Matrix typedef | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| MatrixRef typedef | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| MAXIMAL_NUMBER_OF_ITERATIONS enum value | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| num_constraints_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| num_constraints_compile_time_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protectedstatic |
| num_general_constraints_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| num_simple_bounds_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| OK enum value | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| primal_size_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| primal_step_direction_ | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
| reserve(const MatrixIndex primal_size, const MatrixIndex num_simple_bounds, const MatrixIndex num_general_constraints) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inline |
| reserveDual(const MatrixIndex primal_size) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| reserveMachinery(const MatrixIndex primal_size, const MatrixIndex num_general_constraints) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| ReturnStatus enum name | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| Scalar typedef | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| setZero(t_primal &primal) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| setZero(VectorRef primal) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprivate |
| solveGeneric(t_primal &primal, t_H &H, const t_h &h, const t_lb &lb, const t_ub &ub, const t_A &A, const t_Alb &Alb, const t_Aub &Aub, const SolverParameters ¶m) | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inlineprotected |
| SolverBase() | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | inline |
| UNDEFINED enum value | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| Vector typedef | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | |
| VectorRef typedef | qpmad::SolverBase< t_Scalar, t_primal_size, t_has_bounds, t_general_ctr_number > | protected |
