IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v45y2020i1p99-128.html
   My bibliography  Save this article

Discrete Midpoint Convexity

Author

Listed:
  • Satoko Moriguchi

    (Department of Economics and Business Administration, Tokyo Metropolitan University, Tokyo 192-0397, Japan;)

  • Kazuo Murota

    (Department of Economics and Business Administration, Tokyo Metropolitan University, Tokyo 192-0397, Japan;)

  • Akihisa Tamura

    (Department of Mathematics, Keio University, Yokohama 223-8522, Japan;)

  • Fabio Tardella

    (Department of Methods and Models for Economics, Territory and Finance, Sapienza University of Rome, Rome 00161, Italy)

Abstract

For a function defined on the integer lattice, we consider discrete versions of midpoint convexity, which offer a unifying framework for discrete convexity of functions, including integral convexity, L ♮ -convexity, and submodularity. By considering discrete midpoint convexity for all pairs at ℓ ∞ -distance equal to 2 or not smaller than 2, we identify new classes of discrete convex functions, called locally and globally discrete midpoint convex functions . These functions enjoy nice structural properties. They are stable under scaling and addition and satisfy a family of inequalities named parallelogram inequalities . Furthermore, they admit a proximity theorem with the same small proximity bound as that for L ♮ -convex functions. These structural properties allow us to develop an algorithm for the minimization of locally and globally discrete midpoint convex functions based on the proximity-scaling approach and on a novel 2-neighborhood steepest descent algorithm.

Suggested Citation

  • Satoko Moriguchi & Kazuo Murota & Akihisa Tamura & Fabio Tardella, 2020. "Discrete Midpoint Convexity," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 99-128, February.
    • Handle: RePEc:inm:ormoor:v:45:y:2020:i:1:p:99-128
    DOI: 10.1287/moor.2018.0984
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2018.0984
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2018.0984?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
    ---><---

    References listed on IDEAS

    as
    1. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    2. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    3. Paul Zipkin, 2008. "On the Structure of Lost-Sales Inventory Models," Operations Research, INFORMS, vol. 56(4), pages 937-944, August.
    4. Iimura, Takuya & Murota, Kazuo & Tamura, Akihisa, 2005. "Discrete fixed point theorem reconsidered," Journal of Mathematical Economics, Elsevier, vol. 41(8), pages 1030-1036, December.
    5. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
    6. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.
    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. Shaomin Li & Haoyu Wei & Xiaoyu Lei, 2022. "Heterogeneous Overdispersed Count Data Regressions via Double-Penalized Estimations," Mathematics, MDPI, vol. 10(10), pages 1-25, May.

    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. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    2. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    3. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
    4. Christos Zacharias & Michael Pinedo, 2017. "Managing Customer Arrivals in Service Systems with Multiple Identical Servers," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 639-656, October.
    5. Mohammadreza Bolandnazar & Woonghee Tim Huh & S. Thomas McCormick & Kazuo Murota, 2019. "Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005)," Operations Research, INFORMS, vol. 67(1), pages 163-166, January.
    6. Samson Alva & Battal Dou{g}an, 2021. "Choice and Market Design," Papers 2110.15446, arXiv.org, revised Nov 2021.
    7. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    8. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    9. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
    10. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    11. van der Laan, Gerard & Talman, Dolf & Yang, Zaifu, 2011. "Solving discrete systems of nonlinear equations," European Journal of Operational Research, Elsevier, vol. 214(3), pages 493-500, November.
    12. Iraklis Kollias & John Leventides & Vassilios G. Papavassiliou, 2022. "On the solution of games with arbitrary payoffs: An application to an over-the-counter financial market," Working Papers 202302, Geary Institute, University College Dublin.
    13. Sasanuma, Katsunobu & Delasay, Mohammad & Pitocco, Christine & Scheller-Wolf, Alan & Sexton, Thomas, 2022. "A marginal analysis framework to incorporate the externality effect of ordering perishables," Operations Research Perspectives, Elsevier, vol. 9(C).
    14. Fu, Hu & Kleinberg, Robert & Lavi, Ron & Smorodinsky, Rann, 2017. "Job security, stability and production efficiency," Theoretical Economics, Econometric Society, vol. 12(1), January.
    15. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
    16. Woonghee Tim Huh & Ganesh Janakiraman & John A. Muckstadt & Paat Rusmevichientong, 2009. "An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 397-416, May.
    17. Lamghari-Idrissi, Douniel & Basten, Rob & van Houtum, Geert-Jan, 2020. "Spare parts inventory control under a fixed-term contract with a long-down constraint," International Journal of Production Economics, Elsevier, vol. 219(C), pages 123-137.
    18. Bendre, Abhijit Bhagwan & Nielsen, Lars Relund, 2013. "Inventory control in a lost-sales setting with information about supply lead times," International Journal of Production Economics, Elsevier, vol. 142(2), pages 324-331.
    19. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    20. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.

    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:inm:ormoor:v:45:y:2020:i:1:p:99-128. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.