The opposite of analytic centering for solving minimum rank problems in control and identification

Recently it has been shown that certain control problems can be formulated as minimum rank problems with linear matrix inequalities. Also in identification there are problems that can be formulated in a similar way. In this paper a heuristic algorithm for solving these problems is presented. It is illustrated with some numerical examples.<<ETX>>