An interval-matrix branch-and-bound algorithm for bounding eigenvalues

DOI10.1080/10556788.2016.1184663zbMath1390.90576OpenAlexW2469708138MaRDI QIDQ4594837

Dimitrios Nerantzis, Claire S. Adjiman

Publication date: 24 November 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1184663

zbMATH Keywords

global optimizationbranch and boundinterval matrixeigenvalue bounds

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)

This page was built for publication: An interval-matrix branch-and-bound algorithm for bounding eigenvalues