An interval-matrix branch-and-bound algorithm for bounding eigenvalues.
Dimitrios NerantzisClaire S. AdjimanPublished in: Optim. Methods Softw. (2017)
Keyphrases
- branch and bound algorithm
- upper bound
- lower bound
- eigenvalues and eigenvectors
- covariance matrix
- branch and bound
- singular value decomposition
- test problems
- singular values
- lower bounding
- correlation matrix
- np hard
- optimal solution
- combinatorial optimization
- single machine scheduling problem
- max sat
- upper bounding
- mixed integer linear programming
- precedence constraints
- lagrangian relaxation
- symmetric matrices
- variable ordering
- positive definite
- branch and bound method
- maximum clique
- finding an optimal solution
- column generation
- distance measure
- multi objective