An efficient algorithm to compute maximum entropy densities
We describe an algorithm to efficiently compute maximum entropy densities, i.e. densities maximizing the Shannon entropy - [image omitted]� under a set of constraints [image omitted]�. Our method is based on an algorithm by Zellner and Highfield, which has been found not to converge under a variety of circumstances. To demonstrate that our method overcomes these difficulties, we conduct numerous experiments for the special case gi(x) = xi, n = 4. An extensive table of results for this case and computer code are available on the World Wide Web
Volume (Year): 18 (1999)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/LECR20 |
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/LECR20|
When requesting a correction, please mention this item's handle: RePEc:taf:emetrv:v:18:y:1999:i:2:p:127-140. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.