IDEAS home Printed from https://ideas.repec.org/p/kob/dpaper/dp2016-26.html
   My bibliography  Save this paper

Fast Bellman Iteration: An Application of Legendre-Fenchel Duality to Deterministic Dynamic Programming in Discrete Time

Author

Listed:
  • Ronaldo Carpio

    (School of Business and Finance, University of International Business and Economics)

  • Takashi Kamihigashi

    (Research Institute for Economics & Business Administration (RIEB), Kobe University, Japan)

Abstract

We propose an algorithm, which we call " Fast Bellman Iteration " (FBI), to compute the value function of a deterministic infinite-horizon dynamic programming problem in discrete time. FBI is an efficient algorithm applicable to a class of multidimensional dynamic programming problems with concave return (or convex cost) functions and linear constraints. In this algorithm, a sequence of functions is generated starting from the zero function by repeatedly applying a simple algebraic rule involving the Legendre-Fenchel transform of the return function. The resulting sequence is guaranteed to converge, and the Legendre-Fenchel transform of the limiting function coincides with the value function.

Suggested Citation

  • Ronaldo Carpio & Takashi Kamihigashi, 2016. "Fast Bellman Iteration: An Application of Legendre-Fenchel Duality to Deterministic Dynamic Programming in Discrete Time," Discussion Paper Series DP2016-26, Research Institute for Economics & Business Administration, Kobe University.
    • Handle: RePEc:kob:dpaper:dp2016-26
    as

    Download full text from publisher

    File URL: https://www.rieb.kobe-u.ac.jp/academic/ra/dp/English/DP2016-26.pdf
    File Function: First version, 2016
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Takashi Kamihigashi, 2014. "Elementary results on solutions to the bellman equation of dynamic programming: existence, uniqueness, and convergence," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 251-273, June.
    2. Takashi Kamihigashi, 2014. "An order-theoretic approach to dynamic programming: an exposition," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 13-21, April.
    3. Takashi Kamihigashi & Kevin Reffett & Masayuki Yao, 2015. "An application of Kleene's fixed point theorem to dynamic programming," International Journal of Economic Theory, The International Society for Economic Theory, vol. 11(4), pages 429-434, December.
    4. Takashi Kamihigashi, 2008. "On the principle of optimality for nonstationary deterministic dynamic programming," International Journal of Economic Theory, The International Society for Economic Theory, vol. 4(4), pages 519-525, December.
    5. Klein, C. M. & Morin, T. L., 1991. "Conjugate duality and the curse of dimensionality," European Journal of Operational Research, Elsevier, vol. 50(2), pages 220-228, January.
    Full references (including those not matched with items on IDEAS)

    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. Ronaldo Carpio & Takashi Kamihigashi, 2015. "Fast Bellman Iteration: An Application of Legendre-Fenchel Duality to Infinite-Horizon Dynamic Programming in Discrete Time," Discussion Paper Series DP2015-11, Research Institute for Economics & Business Administration, Kobe University.
    2. Takashi Kamihigashi & Masayuki Yao, 2016. "Infinite-Horizon Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle and a Penalty Method," Discussion Paper Series DP2016-05, Research Institute for Economics & Business Administration, Kobe University, revised May 2016.
    3. Ronaldo Carpio & Takashi Kamihigashi, 2019. "Fast Value Iteration: An Application of Legendre-Fenchel Duality to a Class of Deterministic Dynamic Programming Problems in Discrete Time," Discussion Paper Series DP2019-24, Research Institute for Economics & Business Administration, Kobe University.
    4. Takashi Kamihigashi & Kevin Reffett & Masayuki Yao, 2014. "An Application of Kleene's Fixed Point Theorem to Dynamic Programming: A Note," Working Papers 2014-398, Department of Research, Ipag Business School.
    5. Takashi Kamihigashi & Masayuki Yao, 2015. "Infnite-Horizon Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle," Discussion Paper Series DP2015-32, Research Institute for Economics & Business Administration, Kobe University.
    6. Takashi Kamihigashi & Masayuki Yao, 2015. "Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle," Discussion Paper Series DP2015-15, Research Institute for Economics & Business Administration, Kobe University.
    7. Masayuki Yao, 2016. "Recursive Utility and the Solution to the Bellman Equation," Discussion Paper Series DP2016-08, Research Institute for Economics & Business Administration, Kobe University.
    8. Agnieszka Wiszniewska-Matyszkiel & Rajani Singh, 2020. "When Inaccuracies in Value Functions Do Not Propagate on Optima and Equilibria," Mathematics, MDPI, vol. 8(7), pages 1-25, July.
    9. Takashi Kamihigashi, 2014. "Elementary results on solutions to the bellman equation of dynamic programming: existence, uniqueness, and convergence," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 251-273, June.
    10. Takashi Kamihigashi, 2014. "An order-theoretic approach to dynamic programming: an exposition," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 13-21, April.
    11. Kikuchi, Tomoo & Nishimura, Kazuo & Stachurski, John & Zhang, Junnan, 2021. "Coase meets Bellman: Dynamic programming for production networks," Journal of Economic Theory, Elsevier, vol. 196(C).
    12. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    13. Gaetano Bloise & Cuong Le Van & Yiannis Vailakis, 2024. "Do not Blame Bellman: It Is Koopmans' Fault," Econometrica, Econometric Society, vol. 92(1), pages 111-140, January.
    14. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01169552, HAL.
    15. Tom D. Holden, 2023. "Existence and Uniqueness of Solutions to Dynamic Models with Occasionally Binding Constraints," The Review of Economics and Statistics, MIT Press, vol. 105(6), pages 1481-1499, November.
    16. Bloise, G. & Van, C. Le & Vailakis, Y., 2024. "An approximation approach to dynamic programming with unbounded returns," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    17. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2018. "On temporal aggregators and dynamic programming," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 66(3), pages 787-817, October.
    18. Takashi Kamihigashi, 2011. "Existence and Uniqueness of a Fixed Point for the Bellman Operator in Deterministic Dynamic Programming," Discussion Paper Series DP2011-23, Research Institute for Economics & Business Administration, Kobe University.
    19. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    20. Luis A. Alcala, 2016. "On the time consistency of collective preferences," Papers 1607.02688, arXiv.org, revised Jul 2018.

    More about this item

    Keywords

    Dynamic programming; Legendre-Fenchel transform; Bellman operator; Convex analysis;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:kob:dpaper:dp2016-26. 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: Office of Promoting Research Collaboration, Research Institute for Economics & Business Administration, Kobe University (email available below). General contact details of provider: https://edirc.repec.org/data/rikobjp.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.