IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i1d10.1007_s10589-015-9760-6.html
   My bibliography  Save this article

Using multiobjective optimization to map the entropy region

Author

Listed:
  • László Csirmaz

    () (Central European University
    Rényi Institute)

Abstract

Abstract Mapping the structure of the entropy region of at least four jointly distributed random variables is an important open problem. Even partial knowledge about this region has far reaching consequences in other areas in mathematics, like information theory, cryptography, probability theory and combinatorics. Presently, the only known method of exploring the entropy region is, or equivalent to, the one of Zhang and Yeung from 1998. Using some non-trivial properties of the entropy function, their method is transformed to solving high dimensional linear multiobjective optimization problems. Benson’s outer approximation algorithm is a fundamental tool for solving such optimization problems. An improved version of Benson’s algorithm is presented, which requires solving one scalar linear program in each iteration rather than two or three as in previous versions. During the algorithm design, special care is taken for numerical stability. The implemented algorithm is used to verify previous statements about the entropy region, as well as to explore it further. Experimental results demonstrate the viability of the improved Benson’s algorithm for determining the extremal set of medium-sized numerically ill-posed optimization problems. With larger problem sizes, two limitations of Benson’s algorithm is observed: the inefficiency of the scalar LP solver, and the unexpectedly large number of intermediate vertices.

Suggested Citation

  • László Csirmaz, 2016. "Using multiobjective optimization to map the entropy region," Computational Optimization and Applications, Springer, vol. 63(1), pages 45-67, January.
  • Handle: RePEc:spr:coopap:v:63:y:2016:i:1:d:10.1007_s10589-015-9760-6
    DOI: 10.1007/s10589-015-9760-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-015-9760-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Matthias Ehrgott & Andreas Löhne & Lizhen Shao, 2012. "A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming," Journal of Global Optimization, Springer, vol. 52(4), pages 757-778, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. repec:spr:jglopt:v:69:y:2017:i:2:d:10.1007_s10898-017-0519-8 is not listed on IDEAS

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:63:y:2016:i:1:d:10.1007_s10589-015-9760-6. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.