IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i1p45-67.html
   My bibliography  Save this article

Using multiobjective optimization to map the entropy region

Author

Listed:
  • László Csirmaz

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. Copyright Springer Science+Business Media New York 2016

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:p:45-67
    DOI: 10.1007/s10589-015-9760-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-015-9760-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-015-9760-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Andreas Löhne & Andrea Wagner, 2017. "Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver," Journal of Global Optimization, Springer, vol. 69(2), pages 369-385, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nghe, Philippe & Mulder, Bela M. & Tans, Sander J., 2018. "A graph-based algorithm for the multi-objective optimization of gene regulatory networks," European Journal of Operational Research, Elsevier, vol. 270(2), pages 784-793.
    2. Britta Schulze & Kathrin Klamroth & Michael Stiglmayr, 2019. "Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions," Journal of Global Optimization, Springer, vol. 74(3), pages 495-522, July.
    3. Kellner, Florian & Lienland, Bernhard & Utz, Sebastian, 2019. "An a posteriori decision support methodology for solving the multi-criteria supplier selection problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 505-522.
    4. Victor Blanco & Justo Puerto & Safae El Haj Ben Ali, 2014. "A Semidefinite Programming approach for solving Multiobjective Linear Programming," Journal of Global Optimization, Springer, vol. 58(3), pages 465-480, March.
    5. Daniel Ciripoi & Andreas Löhne & Benjamin Weißing, 2018. "A vector linear programming approach for certain global optimization problems," Journal of Global Optimization, Springer, vol. 72(2), pages 347-372, October.
    6. Zachary Feinstein & Birgit Rudloff, 2017. "A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle," Journal of Global Optimization, Springer, vol. 68(1), pages 47-69, May.
    7. Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Discussion Paper 2023-012, Tilburg University, Center for Economic Research.
    8. Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
    9. Koenen, Melissa & Balvert, Marleen & Fleuren, H.A., 2023. "A Renewed Take on Weighted Sum in Sandwich Algorithms : Modification of the Criterion Space," Other publications TiSEM 795b6c0c-c7bc-4ced-9d6b-a, Tilburg University, School of Economics and Management.
    10. Zachary Feinstein & Birgit Rudloff, 2015. "A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle," Papers 1508.02367, arXiv.org, revised Jul 2016.

    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:p:45-67. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.