Special-Purpose Algorithms for Linearly Constrained Entropy Maximization

Yair Censor, Tommy Elfving, Gabor T. Herman, C. Ray Smith (Editor), Gary J. Erickson (Editor)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a family of algorithms of the row-action type that are suitable for solving large and sparse entropy maximization problems with linear constraints. The algorithms are designed to handle equality constraints, in-equality constraints, or interval constraints (that is, pairs of inequalities). Six iterative algorithms are discussed, but for one of them convergence of the process is not yet proven. No experimental results are presented.
Original languageEnglish
Title of host publicationMaximum-Entropy and Bayesian Spectral Analysis and Estimation Problems
Subtitle of host publicationProceedings of the Third Workshop on Maximum Entropy and Bayesian Methods in Applied Statistics, Wyoming, U.S.A., August 1–4, 1983
EditorsC. Ray Smith, Gary J. Erickson
Place of PublicationDordrecht
PublisherSpringer
Chapter14
Pages241-254
Number of pages14
ISBN (Electronic)978-94-009-3961-5
ISBN (Print)978-94-010-8257-0
DOIs
StatePublished - 1987

Publication series

NameFundamental Theories of Physics
PublisherSpringer
Volume21
ISSN (Print)0168-1222
ISSN (Electronic)2365-6425

Fingerprint

Dive into the research topics of 'Special-Purpose Algorithms for Linearly Constrained Entropy Maximization'. Together they form a unique fingerprint.

Cite this