Maximum entropy and robust prediction on a simplex

The related problems of (finite-length) robust prediction and maximizing spectral entropy over a simplex of covariance matrices are considered. General properties of iterative solutions of these problems are developed, and monotone convergence proofs are presented for two algorithms that provide such solutions. The analogous problems for simplexes of spectral densities are also considered.