A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem

A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem

0.00 Avg rating0 Votes
Article ID: iaor1998903
Country: Netherlands
Volume: 79
Issue: 2
Start Page Number: 369
End Page Number: 378
Publication Date: Dec 1994
Journal: European Journal of Operational Research
Authors: ,
Keywords: entropy, duality
Abstract:

In this paper, we propose a curved-search algorithm for solving the cross-entropy minimization problem with linear equality constraints. The proposed algorithm converges globally to a dual optimal solution with a quadratic rate of convergence. A dual-to-primal conversion formula is provided. We also analyze the computational effort required for the algorithm and report our computational experience.

Reviews

Required fields are marked *. Your email address will not be published.