Class ExtremalGeneralizedEigenvalueByGreedySearch

    • Constructor Detail

      • ExtremalGeneralizedEigenvalueByGreedySearch

        public ExtremalGeneralizedEigenvalueByGreedySearch​(Matrix A,
                                                           Matrix B)
        Constructs the problem described in Section 3.2, d'Aspremont (2008), changed to a minimization problem.
        Parameters:
        A - the matrix A in eq. 10, reference [1]
        B - the matrix B in eq. 10, reference [1]
      • ExtremalGeneralizedEigenvalueByGreedySearch

        public ExtremalGeneralizedEigenvalueByGreedySearch​(Matrix A,
                                                           Matrix B,
                                                           boolean isMinimizationProblem)
        Constructs the problem described in Section 3.2, d'Aspremont (2008).
        Parameters:
        A - the matrix A in eq. 10, reference [1]
        B - the matrix B in eq. 10, reference [1]
        isMinimizationProblem - if true, eq. 10 in reference [1] is changed to a minimization problem
    • Method Detail

      • getOptimalPositions

        public Vector getOptimalPositions​(int minCard,
                                          int maxCard)
      • getOptimalValue

        public double getOptimalValue()