Author:
Fang S.-C.,Rajasekera J. R.,Tsao H.-S. J.
Reference32 articles.
1. Baierlein, R., “How Entropy Got Its Name,” American Journal of Physics, Vol. 60, 1992, p. 1151.
2. Ben-Tal, A., Teboulle, M., and Charnes, A., “The Role of Duality in Optimization Problems involving Entropy Functionals with Applications to Information Theory,” Journal of Optimization Theory and Applications, Vol. 58, 1988, pp. 209–223.
3. Bregman, L.M., “The Relaxation Method of Finding the Common Point of Convex Sets and its Application to the Solution of Problems in Convex Programming,” U.S.S.R. Computational Mathematics and Mathematical Physics, Vol. 7, 1967, pp. 200–217.
4. Censor, Y., Elfving, T., and Herman, G.T., “Special Purpose Algorithms for Linearly Constrained Optimization,” Maximum-Entropy and Bayesian Spectral Analysis and Estimation Problems, edited by C.R. Smith and G.J. Erickson, D. Reidel Publishing Company, 1987, pp. 241–254.
5. Censor, Y., De Pierro, A.R., Elfving, T., Herman, G.T., and Iusem, A.N., “On Maximization of Entropies and Generalization of Bregman’s Method of Convex Programming,” Technical Report MIPG 113, Medical Image Processing Group, Department of Radiology, Hospital of the University of Pennsylvania, Philadelphia, PA., 1986.