Title :
Iterative convex I-projection algorithms for maximum entropy and minimum cross-entropy computations
Author_Institution :
Sch. of Nursing, Washington Univ., Seattle, WA, USA
fDate :
5/1/1989 12:00:00 AM
Abstract :
General multiple-constraint minimum-cross-entropy and maximum-entropy problems can be solved by the iterative solution of single constraint subproblems. Existing theoretical results justify iterative I-projection algorithms that may be computationally expedient in some cases. An iterative algorithm for J.E. Shore´s (ibid., vol.IT-28, no.6, p.956-61, Nov. 1982) minimum cross-entropy spectral analysis is developed as an example
Keywords :
entropy; information theory; iterative methods; spectral analysis; constraint subproblems; convex I-projection algorithms; iterative I-projection algorithms; maximum entropy; minimum cross-entropy; spectral analysis; Aquaculture; Art; Binary codes; Entropy; Frequency; Iterative algorithms; Notice of Violation; Probability density function; Probability distribution; Spectral analysis;
Journal_Title :
Information Theory, IEEE Transactions on
