IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v78y2013i1p61-76.html

Accelerated modified policy iteration algorithms for Markov decision processes

Author

Listed:
  • Oleksandr Shlakhter

  • Chi-Guhn Lee

Abstract

We propose a new approach to accelerate the convergence of the modified policy iteration method for Markov decision processes with the total expected discounted reward. In the new policy iteration an additional operator is applied to the iterate generated by Markov operator, resulting in a bigger improvement in each iteration. Copyright Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Oleksandr Shlakhter & Chi-Guhn Lee, 2013. "Accelerated modified policy iteration algorithms for Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 61-76, August.
    • Handle: RePEc:spr:mathme:v:78:y:2013:i:1:p:61-76
    DOI: 10.1007/s00186-013-0432-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-013-0432-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-013-0432-y?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Herzberg, Meir & Yechiali, Uri, 1996. "A K-step look-ahead analysis of value iteration algorithms for Markov decision processes," European Journal of Operational Research, Elsevier, vol. 88(3), pages 622-636, February.
    2. Meir Herzberg & Uri Yechiali, 1994. "Accelerating Procedures of the Value Iteration Algorithm for Discounted Markov Decision Processes, Based on a One-Step Lookahead Analysis," Operations Research, INFORMS, vol. 42(5), pages 940-946, October.
    3. Oleksandr Shlakhter & Chi-Guhn Lee & Dmitry Khmelev & Nasser Jaber, 2010. "Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes," Operations Research, INFORMS, vol. 58(1), pages 193-202, February.
    4. M. A. Pollatschek & B. Avi-Itzhak, 1969. "Algorithms for Stochastic Games with Geometrical Interpretation," Management Science, INFORMS, vol. 15(7), pages 399-415, March.
    5. Martin L. Puterman & Moon Chirl Shin, 1978. "Modified Policy Iteration Algorithms for Discounted Markov Decision Problems," Management Science, INFORMS, vol. 24(11), pages 1127-1137, July.
    6. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    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. Vineet Goyal & Julien Grand-Clément, 2023. "A First-Order Approach to Accelerated Value Iteration," Operations Research, INFORMS, vol. 71(2), pages 517-535, March.
    2. Oleksandr Shlakhter & Chi-Guhn Lee & Dmitry Khmelev & Nasser Jaber, 2010. "Acceleration Operators in the Value Iteration Algorithms for Markov Decision Processes," Operations Research, INFORMS, vol. 58(1), pages 193-202, February.
    3. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2026. "A primal–dual policy iteration algorithm for constrained Markov decision processes," European Journal of Operational Research, Elsevier, vol. 328(1), pages 174-188.
    4. Herzberg, Meir & Yechiali, Uri, 1996. "A K-step look-ahead analysis of value iteration algorithms for Markov decision processes," European Journal of Operational Research, Elsevier, vol. 88(3), pages 622-636, February.
    5. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    6. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
    7. Matthew S. Maxwell & Mateo Restrepo & Shane G. Henderson & Huseyin Topaloglu, 2010. "Approximate Dynamic Programming for Ambulance Redeployment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 266-281, May.
    8. Sauré, Antoine & Patrick, Jonathan & Tyldesley, Scott & Puterman, Martin L., 2012. "Dynamic multi-appointment patient scheduling for radiation therapy," European Journal of Operational Research, Elsevier, vol. 223(2), pages 573-584.
    9. Cai, Yongyang & Judd, Kenneth L. & Lontzek, Thomas S. & Michelangeli, Valentina & Su, Che-Lin, 2017. "A Nonlinear Programming Method For Dynamic Programming," Macroeconomic Dynamics, Cambridge University Press, vol. 21(2), pages 336-361, March.
    10. Yu, Yugang & Luo, Yifei & Shi, Ye, 2022. "Adoption of blockchain technology in a two-stage supply chain: Spillover effect on workforce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    11. Danial Khorasanian & Jonathan Patrick & Antoine Sauré, 2024. "Dynamic Home Care Routing and Scheduling with Uncertain Number of Visits per Referral," Transportation Science, INFORMS, vol. 58(4), pages 841-859, July.
    12. Hossein Abouee-Mehrizi & Mahdi Mirjalili & Vahid Sarhangian, 2026. "Platelet Inventory Management with Approximate Dynamic Programming," INFORMS Journal on Computing, INFORMS, vol. 38(1), pages 207-231, January.
    13. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    14. Jonathan Patrick & Martin L. Puterman & Maurice Queyranne, 2008. "Dynamic Multipriority Patient Scheduling for a Diagnostic Resource," Operations Research, INFORMS, vol. 56(6), pages 1507-1525, December.
    15. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    16. Keyvan Eslami & Thomas Phelan, 2025. "The Art of Temporal Approximation: An Investigation into Numerical Solutions to Discrete- and Continuous-Time Problems in Economics," Computational Economics, Springer;Society for Computational Economics, vol. 65(3), pages 1505-1547, March.
    17. David B. Brown & Jingwei Zhang, 2023. "Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 71(6), pages 2374-2389, November.
    18. Michael H. Veatch, 2013. "Approximate Linear Programming for Average Cost MDPs," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 535-544, August.
    19. Daniel Adelman & Adam J. Mersereau, 2008. "Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 56(3), pages 712-727, June.
    20. Oscar Dowson & Lea Kapelevich, 2021. "SDDP.jl : A Julia Package for Stochastic Dual Dynamic Programming," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 27-33, January.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:mathme:v:78:y:2013:i:1:p:61-76. 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.