By Topic

Iterative convex I-projection algorithms for maximum entropy and minimum cross-entropy computations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Burr, R. ; Sch. of Nursing, Washington Univ., Seattle, WA, USA

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

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 3 )