Special-Purpose Algorithms for Linearly Constrained Entropy Maximization

作者: Yair Censor , Tommy Elfving , Gabor T. Herman

DOI: 10.1007/978-94-009-3961-5_14

关键词:

摘要: We present a family of algorithms the row-action type that are suitable for solving large and sparse entropy maximization problems with linear constraints. The designed to handle equality constraints, in-equality or interval constraints (that is, pairs inequalities). Six iterative discussed, but one them convergence process is not yet proven. No experimental results presented.

参考文章(36)
Yair Censor, Entropy optimization via entropy projections System Modeling and Optimization. pp. 450- 454 ,(1982) , 10.1007/BFB0006167
Yair Censor, Intervals in Linear and Nonlinear Problems of Image Reconstruction Springer, Berlin, Heidelberg. pp. 152- 159 ,(1981) , 10.1007/978-3-642-93157-4_13
Gerald Minerbo, MENT: A maximum entropy algorithm for reconstructing a source from projection data Computer Graphics and Image Processing. ,vol. 10, pp. 48- 68 ,(1979) , 10.1016/0146-664X(79)90034-0
Arnold Lent, Yair Censor, Extensions of Hildreth’s Row-Action Method for Quadratic Programming SIAM Journal on Control and Optimization. ,vol. 18, pp. 444- 454 ,(1980) , 10.1137/0318033
Tommy Elfving, On some methods for entropy maximization and matrix scaling Linear Algebra and its Applications. ,vol. 34, pp. 321- 339 ,(1980) , 10.1016/0024-3795(80)90171-8
Y. Censor, A. Lent, An iterative row-action method for interval convex programming Journal of Optimization Theory and Applications. ,vol. 34, pp. 321- 353 ,(1981) , 10.1007/BF00934676