public class ExtremalGeneralizedEigenvalueByGreedySearch extends Object implements ExtremalGeneralizedEigenvalueSolver
| Constructor and Description |
|---|
ExtremalGeneralizedEigenvalueByGreedySearch(Matrix A,
Matrix B)
Constructs the problem described in Section 3.2, d'Aspremont (2008),
changed to a minimization problem.
|
ExtremalGeneralizedEigenvalueByGreedySearch(Matrix A,
Matrix B,
boolean isMinimizationProblem)
Constructs the problem described in Section 3.2, d'Aspremont (2008).
|
| Modifier and Type | Method and Description |
|---|---|
Vector |
computeOptimalPositions(int card)
Computes the solution to the problem described in Section 3.2 in reference.
|
Vector |
getOptimalPositions(int minCard,
int maxCard) |
double |
getOptimalValue() |
public ExtremalGeneralizedEigenvalueByGreedySearch(Matrix A, Matrix B)
A - the matrix A in eq. 10, reference [1]B - the matrix B in eq. 10, reference [1]public ExtremalGeneralizedEigenvalueByGreedySearch(Matrix A, Matrix B, boolean isMinimizationProblem)
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 problempublic Vector computeOptimalPositions(int card)
ExtremalGeneralizedEigenvalueSolvercomputeOptimalPositions in interface ExtremalGeneralizedEigenvalueSolvercard - the cardinality constraint, the number of non-zero elements in x, the solutionpublic Vector getOptimalPositions(int minCard, int maxCard)
public double getOptimalValue()
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.