The greedy strategy in optimizing the Perron eigenvalue

Understand

We address the problems of minimizing and of maximizing the spectral radius overa compact family of non-negative matrices.

• Those problems being hard in generalcan be efficiently solved for some special families.
• We consider the so-called prod-uct families, where each matrix is composed of rows chosen independently from givensets.
• A recently introduced greedy method works very fast.