Abstract
In this paper, a simple proof of duality results is presented that was recently derived by Zhang and Brockett [SIAM J. Appl. Math., 47 (1987), pp. 871–885] for the problem of minimizing the Kullback–Liebler discrimination information measure subject to quadratic and linear inequality constraints. The proof is a direct and simple application of Lagrangian Duality Theory and is extended to a more general class of entropy optimization problems with composite convex constraints.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
