Alternating Direction Method for Maximum Entropy Subject to Simple Constraint Sets
Tóm tắt
The problem of maximizing the entropy subject to simple constraint sets is reformulated as a structured variational inequality problem by introducing dual variables. A new iterative alternating direction method is then developed that generates alternatively the dual and primal iterates. For some existing maximum entropy problems in the literature, the new dual iterate can be derived from a simple projection and then the new primal iterate can be obtained via solving approximately n separate one-dimensional strong monotone equations. Therefore, the proposed method is very easy to carry out. Preliminary numerical results show that the method is applicable.
Tài liệu tham khảo
Gull, S. F., and Skilling, J., Maximum Entropy Method in Image Processing, IEE Proceedings, Vol. 131F, pp. 646–659, 1984.
Jaynes, E. T., On the Rationale of Maximum Entropy Methods, IEE Proceedings, Vol. 70, pp. 939–952, 1982.
Yang, H., and Wong, S. C., The Most Likely Equilibrium Traffic Queuing Pattern in a Capacity Constrained Network, Annals of Operations Research, Vol. 87, pp. 73–85, 1999.
Powell, M. J. D., An Algorithm for Maximizing Entropy Subject to Simple Bounds, Mathematical Programming, Vol. 42, pp. 171–180, 1988.
Eriksson, J., A Note on Solution of Large Sparse Maximum Entropy Problems with Linear Equality Constraints, Mathematical Programming, Vol. 18, pp. 146–154, 1980.
Fletcher, R., Practical Methods of Optimization, Wiley, New York, NY, 1985.
He, B. S., Inexact Implicit Methods for Monotone General Variational Inequalities, Mathematical Programming, Vol. 86, pp. 199–216, 1999.
He, B. S., Solution and Applications of a Class of General Linear Variational Inequalities, Science in China, Vol. 39A, pp. 395–404, 1996.
He, B. S., A Class of Projection and Contraction Method for Monotone Variational Inequalities, Applied Mathematics and Optimization, Vol. 35, pp. 69–76, 1997.