| constraints_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| costEvaluator_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| evaluateConstraintJacobian(const int nele_jac, MapVecXs &jac) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| evaluateConstraints(MapVecXs &values) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| evaluateCostFun() | ct::optcon::tpl::Nlp< SCALAR > | inline |
| evaluateCostGradient(const size_t n, MapVecXs &grad) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| evaluateHessian(const int nele_hes, MapVecXs &hes, const SCALAR obj_fac, MapConstVecXs &lambda) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| ExampleProblem() | ExampleProblem< SCALAR > | inline |
| ExampleProblem() | ExampleProblem< SCALAR > | inline |
| extractIpoptSolution(const MapConstVecXs &x, const MapConstVecXs &zL, const MapConstVecXs &zU, const MapConstVecXs &lambda) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| extractOptimizationVars(const MapConstVecXs &x, bool isNew) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| extractSnoptSolution(const MapVecXs &x, const MapVecXs &xMul, const MapVecXi &xState, const MapVecXs &fMul, const MapVecXi &fState) | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getBoundMultipliers(size_t n, MapVecXs &zLow, MapVecXs &zUp) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getConstraintBounds(MapVecXs &lowerBound, MapVecXs &upperBound, const size_t m) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getConstraintsCount() const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getConstraintsMultState(const size_t m, MapVecXs &zMul, MapVecXi &zState) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getInitialGuess(const size_t n, MapVecXs &x) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getLambdaVars(size_t m, MapVecXs &lambda) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getNonZeroHessianCount() | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getNonZeroJacobianCount() const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getOptimizationMultState(const size_t n, MapVecXs &xMul, MapVecXi &xState) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getSolution() | ExampleProblem< SCALAR > | inline |
| getSolution() | ExampleProblem< SCALAR > | inline |
| getSparsityPatternHessian(const int nele_hes, MapVecXi &iRow, MapVecXi &jCol) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getSparsityPatternJacobian(const int nele_jac, MapVecXi &iRow, MapVecXi &jCol) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getVarCount() const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| getVariableBounds(MapVecXs &lowerBound, MapVecXs &upperBound, const size_t n) const | ct::optcon::tpl::Nlp< SCALAR > | inline |
| iRowHessian_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| iRowHessianConstraints_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| iRowHessianCost_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| jColHessian_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| jColHessianConstraints_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| jColHessianCost_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| MapConstVecXs typedef | ct::optcon::tpl::Nlp< SCALAR > | |
| MapVecXi typedef | ct::optcon::tpl::Nlp< SCALAR > | |
| MapVecXs typedef | ct::optcon::tpl::Nlp< SCALAR > | |
| Nlp()=default | ct::optcon::tpl::Nlp< SCALAR > | |
| optVariables_ | ct::optcon::tpl::Nlp< SCALAR > | protected |
| updateProblem() override | ExampleProblem< SCALAR > | inlinevirtual |
| updateProblem() override | ExampleProblem< SCALAR > | inlinevirtual |
| VectorXi typedef | ct::optcon::tpl::Nlp< SCALAR > | |
| VectorXs typedef | ct::optcon::tpl::Nlp< SCALAR > | |
| ~ExampleProblem() override=default | ExampleProblem< SCALAR > | |
| ~ExampleProblem() override=default | ExampleProblem< SCALAR > | |
| ~Nlp()=default | ct::optcon::tpl::Nlp< SCALAR > | virtual |
1.8.13