CGAL 6.1.1 - CGAL and Solvers

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2]

▼N CGAL |
C Eigen_diagonalize_traits | The class `Eigen_diagonalize_traits` provides an interface to the diagonalization of covariance matrices of Eigen
C Eigen_matrix | The class `Eigen_matrix` is a wrapper around `Eigen` matrix type `Eigen::Matrix`
C Eigen_solver_traits | The class `Eigen_solver_traits` provides an interface to the sparse solvers of Eigen
C Eigen_solver_traits< Eigen::BiCGSTAB< Eigen_sparse_matrix< double >::EigenType > > |
C Eigen_sparse_matrix | The class `Eigen_sparse_matrix` is a wrapper around `Eigen` matrix type `Eigen::SparseMatrix` that represents general matrices, be they symmetric or not
C Eigen_sparse_symmetric_matrix | The class `Eigen_sparse_symmetric_matrix` is a wrapper around `Eigen` matrix type `Eigen::SparseMatrix`
C Eigen_svd | The class `Eigen_svd` provides an algorithm to solve in the least square sense a linear system with a singular value decomposition using Eigen
C Eigen_vector | The class `Eigen_vector` is a wrapper around `Eigen` vector type, which is a simple array of numbers
C GLPK_mixed_integer_program_traits | This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using GLPK, which must be available on the system
C Linear_constraint | The linear constraint of a mixed integer program
C Linear_objective | The linear objective of a mixed integer program
C Mixed_integer_program_traits | The class `CGAL::Mixed_integer_program_traits` provides an interface for formulating and solving (constrained or unconstrained) mixed integer programs
C OSQP_quadratic_program_traits | Wraps the external OSQP solver
C SCIP_mixed_integer_program_traits | This class provides an interface for formulating and solving constrained or unconstrained mixed integer programs using SCIP (which must be available on the system)
C Variable | The variable of a mixed integer program
C DiagonalizeTraits | Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array `a`, using symmetric diagonalization
C LinearProgramTraits | A concept that describes the set of methods used to define and solve a linear programming (`lp`) problem of the general form:
C MixedIntegerProgramLinearConstraint | `MixedIntegerProgramLinearConstraint` is a concept of a linear constraint in a Mixed Integer Programming (MIP) problem
C MixedIntegerProgramLinearObjective | `MixedIntegerProgramLinearObjective` is a concept of the linear objective function in a Mixed Integer Programming (MIP) problem
C MixedIntegerProgramTraits | Concept describing the set of requirements for (constrained or unconstrained) Mixed Integer Programming (MIP) problems. A model of this concept stores the integer variables, linear objective, and linear constraints (if any) and provides a method to solve the problem
C MixedIntegerProgramVariable | `MixedIntegerProgramVariable` is a concept of a variable in a Mixed Integer Programming (MIP) problem
C NormalEquationSparseLinearAlgebraTraits_d | Concept describing the set of requirements for solving the normal equation \( A^t A X = A^t B \), \( A \) being a matrix, \( At \) its transpose matrix, \( B \) and \( X \) being two vectors
C QuadraticProgramTraits | A concept that describes the set of methods used to define and solve a quadratic programming (`qp`) problem of the general form:
▼C SparseLinearAlgebraTraits_d | The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems A \( \times \) X = B
C Matrix | `SparseLinearAlgebraTraits_d::Matrix` is a concept of a sparse matrix class
C Vector | `SparseLinearAlgebraTraits_d::Vector` is a concept of a vector that can be multiplied by a sparse matrix
C SparseLinearAlgebraWithFactorTraits_d | Concept describing the set of requirements for a direct sparse linear system solver with factorization. A model of this concept stores the left-hand matrix (denoted \( A \)) and provides an additional factorization method to solve the system for different right-hand vectors
▼C SvdTraits | The concept `SvdTraits` describes the linear algebra types and algorithms needed to solve in the least square sense a linear system with a singular value decomposition
C Matrix | Concept of matrix type used by the concept `SvdTraits`
C Vector | Concept of vector type used by the concept `SvdTraits`