Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1997 | Published
Journal Article Open

A lower bound for the mixed µ problem

Abstract

The mixed µ problem has been shown to be NP hard so that exact analysis appears intractable. Our goal then is to exploit the problem structure so as to develop a polynomial time algorithm that approximates µ and usually gives good answers. To this end it is shown that µ is equivalent to a real eigenvalue maximization problem, and a power algorithm is developed to tackle this problem. The algorithm not only provides a lower bound for µ but has the property that µ is (almost) always an equilibrium point of the algorithm.

Additional Information

© 1997 IEEE. Manuscript received January 27, 1995. This work was supported by the NSF, ONR, NASA, and Rockwell. The authors would like to thank A. Packard for helpful discussions and M. Newlin for help in implementing the lower-bound software.

Attached Files

Published - 00553696.pdf

Files

00553696.pdf
Files (286.3 kB)
Name Size Download all
md5:d236f8c3ad148b2594bc76f9cd15208f
286.3 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023