Polynomial-time computation of the joint spectral radius for some sets of nonnegative matrices

We propose two simple upper bounds for the joint spectral radius of sets of nonnegative matrices. These bounds, the joint column radius and the joint row radius, can be computed in polynomial time as solutions of convex optimization problems. We show that for general matrices these bounds are within a factor 1/n of the exact value, where n is the size of the matrices. Moreover, for sets of matrices with independent column uncertainties of with independent row uncertainties, the corresponding bounds coincide with the joint spectral radius. In these cases, the joint spectral radius is also given by the largest spectral radius of the matrices in the set. As a byproduct of these results, we propose a polynomial-time technique for solving Boolean optimization problems related to the spectral radius. We also consider economics and engineering applications of our results which were never considered practice due to their intrinsic computational complexity.