### Abstract

We show that the problem of exact computation of the joint spectral radius of a finite set of rank one matrices can be reformulated as the problem of computing the maximum cycle mean in a directed graph and hence be solved efficiently.

Original language | English (US) |
---|---|

Article number | 6425992 |

Pages (from-to) | 731-733 |

Number of pages | 3 |

Journal | Proceedings of the IEEE Conference on Decision and Control |

DOIs | |

State | Published - Dec 1 2012 |

Externally published | Yes |

Event | 51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States Duration: Dec 10 2012 → Dec 13 2012 |

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization

## Fingerprint Dive into the research topics of 'Joint spectral radius of rank one matrices and the maximum cycle mean problem'. Together they form a unique fingerprint.

## Cite this

Ahmadi, A. A., & Parrilo, P. A. (2012). Joint spectral radius of rank one matrices and the maximum cycle mean problem.

*Proceedings of the IEEE Conference on Decision and Control*, 731-733. [6425992]. https://doi.org/10.1109/CDC.2012.6425992