Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234567]

►Ccontextlib.AbstractContextManager
Cproxsuite_nlp.windows_dll_manager.DllDirectoryManager
Cproxsuite_nlp.windows_dll_manager.PathManager
Cproxsuite::nlp::ALMeritFunctionTpl< _Scalar >	Primal-dual augmented Lagrangian-type merit function
Cproxsuite::nlp::ALMeritFunctionTpl< Scalar >
►Cproxsuite::nlp::helpers::base_callback< Scalar >
Cproxsuite::nlp::helpers::history_callback< Scalar >	Store the history of results
Cproxsuite::nlp::helpers::print_callback< Scalar >
►Cproxsuite::nlp::helpers::base_callback< context::Scalar >
Cproxsuite::nlp::python::CallbackWrapper
Cproxsuite::nlp::BaseLogger	A logging utility
Cproxsuite::nlp::BCLParamsTpl< Scalar >
Cproxsuite::nlp::linalg::backend::block_impl< Scalar >	Implementation struct for the recursive block LDLT algorithm
Cproxsuite::nlp::linalg::backend::block_triangular_subsolve_impl< Mode, IsLower >
►Cproxsuite_nlp.C2Function
Cproxsuite_nlp.casadi_utils.CasadiFunction
Cproxsuite::nlp::ComputeSignatureVisitor
Cproxsuite::nlp::ConstraintObjectTpl< Scalar >	Packs a ConstraintSetTpl and C2FunctionTpl together
►Cproxsuite::nlp::ConstraintSetTpl< Scalar >	Base constraint set type
Cproxsuite::nlp::BoxConstraintTpl< Scalar >	Box constraint set \(z \in [z_\min, z_\max]\)
Cproxsuite::nlp::ConstraintSetProductTpl< Scalar >	Cartesian product of multiple constraint sets. This class makes computing multipliers and Jacobian matrix projections more convenient
►Cproxsuite::nlp::ConstraintSetTpl< _Scalar >
Cproxsuite::nlp::EqualityConstraintTpl< _Scalar >	Equality constraints \(c(x) = 0\)
Cproxsuite::nlp::NegativeOrthantTpl< _Scalar >	Negative orthant, for constraints \(h(x)\leq 0\)
Cproxsuite::nlp::NonsmoothPenaltyL1Tpl< _Scalar >	Composite \(\ell_1\)-penalty function \( \|c(x)\|_1 \)
►Cxyz::detail::control_block< T, A >
Cxyz::detail::direct_control_block< T, U, A >
►CCost
Cproxsuite::nlp::python::CostWrapper
►Cboost::python::def_visitor
Cproxsuite::nlp::python::LDLTVisitor< LDLTtype >
Cproxsuite::nlp::python::PolymorphicVisitor< xyz::polymorphic< Base, A > >
►Cxyz::detail::empty_base_optimization< T, CanBeEmptyBaseClass >
Cxyz::polymorphic< proxsuite::nlp::ManifoldAbstractTpl >
Cxyz::polymorphic< proxsuite::nlp::ConstraintSetTpl >
Cxyz::polymorphic< T, A >
Cxyz::detail::empty_base_optimization< std::allocator< proxsuite::nlp::ConstraintSetTpl > >
Cxyz::detail::empty_base_optimization< std::allocator< proxsuite::nlp::ManifoldAbstractTpl > >
Cxyz::detail::empty_base_optimization< std::allocator< T > >
►Cstd::exception	STL class
►Cstd::runtime_error	STL class
Cproxsuite::nlp::RuntimeError
►Cstd::false_type
Cfmt::is_range< MatrixType, proxsuite::nlp::enable_if_eigen_dense< MatrixType, char > >
Cproxsuite::nlp::autodiff::finite_difference_wrapper< Scalar, n >
Cproxsuite::nlp::Linesearch< T >::FunctionSample
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, LHS, RHS >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Dense, Dense >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Dense, Diag >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Dense, TriL >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Dense, TriU >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Diag, Dense >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Diag, Diag >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Diag, TriL >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, Diag, TriU >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriL, Dense >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriL, Diag >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriL, TriL >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriL, TriU >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriU, Dense >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriU, Diag >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriU, TriL >
Cproxsuite::nlp::linalg::backend::GemmT< Scalar, TriU, TriU >
Cxyz::in_place_type_t< T >
►Cboost::python::instance_holder
Cproxsuite::nlp::python::OwningNonOwningHolder< Value >
Cproxsuite::nlp::linalg::ldlt_base< Scalar >	Base interface for LDLT solvers
►Cproxsuite::nlp::linalg::ldlt_base< _Scalar >
Cproxsuite::nlp::linalg::BlockLDLT< _Scalar >	Block sparsity-aware LDLT factorization algorithm
Cproxsuite::nlp::linalg::DenseLDLT< _Scalar >	A fast, recursive divide-and-conquer LDLT algorithm
Cproxsuite::nlp::linalg::ProxSuiteLDLTWrapper< _Scalar >	Use the LDLT from proxsuite
Cproxsuite::nlp::Linesearch< T >	Base linesearch class. Design pattern inspired by Google Ceres-Solver
►Cproxsuite::nlp::Linesearch< Scalar >
Cproxsuite::nlp::ArmijoLinesearch< Scalar >	Basic backtracking Armijo line-search strategy
Cproxsuite::nlp::LogRecord
►Cproxsuite::nlp::ManifoldAbstractTpl< _Scalar, _Options >
Cproxsuite::nlp::VectorSpaceTpl< _Scalar, _Dim, _Options >	Standard Euclidean vector space
►Cproxsuite::nlp::ManifoldAbstractTpl< 3::Scalar, 3::Options >
Cproxsuite::nlp::PinocchioLieGroup< 3, Scalar >
►Cproxsuite::nlp::ManifoldAbstractTpl< _LieGroup::Scalar, _LieGroup::Options >
Cproxsuite::nlp::PinocchioLieGroup< _LieGroup >	Wrap a Pinocchio Lie group into a ManifoldAbstractTpl object
►Cproxsuite::nlp::ManifoldAbstractTpl< _Scalar >
Cproxsuite::nlp::CartesianProductTpl< _Scalar >	The cartesian product of two or more manifolds
►Cproxsuite::nlp::ManifoldAbstractTpl< _Scalar, 0 >
Cproxsuite::nlp::MultibodyConfiguration< _Scalar, _Options >	Multibody configuration group \(\mathcal{Q}\), defined using the Pinocchio library
►Cproxsuite::nlp::ManifoldAbstractTpl< Base::Scalar >
Cproxsuite::nlp::TangentBundleTpl< Base >	Tangent bundle of a base manifold M
►Cproxsuite::nlp::ManifoldAbstractTpl< MultibodyConfiguration< Scalar, 0 >::Scalar >
►Cproxsuite::nlp::TangentBundleTpl< MultibodyConfiguration< Scalar, 0 > >
Cproxsuite::nlp::MultibodyPhaseSpace< Scalar, Options >	The tangent bundle of a multibody configuration group
Cproxsuite::nlp::ManifoldAbstractTpl< Scalar >
►Cproxsuite::nlp::ManifoldAbstractTpl< Scalar, _Options >
Cproxsuite::nlp::MultibodyConfiguration< Scalar, 0 >
►Cproxsuite::nlp::math_types< _Scalar >	Typedefs for math (Eigen vectors, matrices) depending on scalar type
►Cproxsuite::nlp::BaseFunctionTpl< _Scalar >
►Cproxsuite::nlp::C1FunctionTpl< _Scalar >
►Cproxsuite::nlp::C2FunctionTpl< _Scalar >
►Cproxsuite::nlp::ComposeFunctionTpl< _Scalar >
Cproxsuite::nlp::LinearFunctionDifferenceToPoint< _Scalar >	Linear function of difference vector on a manifold, of the form \( r(x) = A(x \ominus \bar{x}) + b \)
►Cproxsuite::nlp::CostFunctionBaseTpl< _Scalar >
Cproxsuite::nlp::CostSumTpl< _Scalar >	Defines the sum of one or more cost functions \(c_1 + c_2 + \cdots\)
►Cproxsuite::nlp::QuadraticResidualCostTpl< _Scalar >	Quadratic function \(\frac{1}{2} r^\top Qr + b^\top r + c\) of a residual
Cproxsuite::nlp::QuadraticDistanceCostTpl< _Scalar >	Weighted quadratic distance \(\frac{1}{2}\|x\ominus \bar{x}\|^2_W\) on a space
Cproxsuite::nlp::func_to_cost< Scalar >
Cproxsuite::nlp::ComposeFunctionTpl< Scalar >	Composition of two functions \(f \circ g\)
►Cproxsuite::nlp::CostFunctionBaseTpl< Scalar >	Base class for differentiable cost functions
►Cproxsuite::nlp::QuadraticResidualCostTpl< Scalar >
Cproxsuite::nlp::QuadraticDistanceCostTpl< Scalar >
Cproxsuite::nlp::LinearFunctionTpl< _Scalar >	Linear residuals \(r(x) = Ax + b\)
Cproxsuite::nlp::ManifoldDifferenceToPoint< _Scalar >
Cproxsuite::nlp::autodiff::finite_difference_wrapper< _Scalar, TOC2 >	Approximate the second derivatives of a given function using finite differences
►Cproxsuite::nlp::C2FunctionTpl< Scalar >	Twice-differentiable function, with method Jacobian and vector-hessian product evaluation
Cproxsuite::nlp::RigidTransformationPointActionTpl< Scalar >
Cproxsuite::nlp::python::C2FunctionWrap
Cproxsuite::nlp::autodiff::finite_difference_wrapper< _Scalar, TOC1 >	Approximate the derivatives of a given function using finite differences, to downcast the function to a C1FunctionTpl
►Cproxsuite::nlp::C1FunctionTpl< Scalar >	Differentiable function, with method for the Jacobian
Cproxsuite::nlp::python::C1FunctionWrap
►Cproxsuite::nlp::BaseFunctionTpl< Scalar >	Base function type
Cproxsuite::nlp::python::FunctionWrap
Cproxsuite::nlp::math_types< Scalar >
Cproxsuite::nlp::math_types< T >
Cproxsuite::nlp::Linesearch< T >::Options
►Cfmt::ostream_formatter
Cfmt::formatter< Eigen::WithFormat< MatrixType > >
Cfmt::formatter< MatrixType, proxsuite::nlp::enable_if_eigen_dense< MatrixType, char > >
Cfmt::formatter< proxsuite::nlp::WorkspaceTpl< Scalar > >
Cfmt::formatter<::proxsuite::nlp::ResultsTpl< Scalar > >
Cboost::python::pointee< xyz::polymorphic< T, A > >
Cproxsuite::nlp::python::PolymorphicVisitor< Poly >
Cproxsuite::nlp::PolynomialTpl< T >	Polynomials represented by their coefficients in decreasing order of degree
Cproxsuite::nlp::PolynomialTpl< Scalar >
Cproxsuite::nlp::ProblemTpl< _Scalar >
Cproxsuite::nlp::ProxNLPSolverTpl< _Scalar >
Cproxsuite::nlp::ResultsTpl< _Scalar >	Results struct, holding the returned data from the solver
►CSolverBase
CEigen::BunchKaufman< MatrixType_, UpLo_ >
Cproxsuite::nlp::linalg::SymbolicBlockMatrix	Symbolic representation of the sparsity structure of a (square) block matrix
►Cproxsuite::nlp::python::internal::ToPythonIndirectPoly< const xyz::polymorphic< T, A > &, MakeHolder >
Cboost::python::to_python_indirect< const xyz::polymorphic< T, A > &, MakeHolder >
►Cproxsuite::nlp::python::internal::ToPythonIndirectPoly< xyz::polymorphic< T, A > &, MakeHolder >
Cboost::python::to_python_indirect< xyz::polymorphic< T, A > &, MakeHolder >
Cproxsuite::nlp::linalg::TriangularBlockMatrix< _MatrixType, _Mode >	Representation for triangular block matrices
Cproxsuite::nlp::WorkspaceTpl< Scalar >
►Cboost::python::wrapper
Cproxsuite::nlp::python::C1FunctionWrap
Cproxsuite::nlp::python::C2FunctionWrap
Cproxsuite::nlp::python::CallbackWrapper
Cproxsuite::nlp::python::CostWrapper
Cproxsuite::nlp::python::FunctionWrap
Cproxsuite::nlp::python::PolymorphicWrapper< _PyBase, _Base >
►CT
Cxyz::detail::empty_base_optimization< T, true >