Solving Stochastic Dynamic Programming Problems: A Mixed Complementarity Approach

被引：0
|
作者：
Wonjun Chang
Michael C. Ferris
Youngdae Kim
Thomas F. Rutherford
机构：
[1] CRA International,Department of Agricultural and Applied Economics
[2] Mathematics and Computer Science Division,Department of Computer Sciences
[3] Argonne National Laboratory,undefined
[4] University of Wisconsin-Madison,undefined
[5] University of Wisconsin-Madison,undefined
[6] Optimization Group,undefined
[7] Wisconsin Institutes for Discovery,undefined
来源：
Computational Economics | 2020年 / 55卷
关键词：
Dynamic Programming; Computable general equilibrium; Complementarity; Computational methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a mixed complementarity problem (MCP) formulation of continuous state dynamic programming problems (DP-MCP). We write the solution to projection methods in value function iteration (VFI) as a joint set of optimality conditions that characterize maximization of the Bellman equation; and approximation of the value function. The MCP approach replaces the iterative component of projection based VFI with a one-shot solution to a square system of complementary conditions. We provide three numerical examples to illustrate our approach.
引用
收藏
页码：925 / 955
页数：30
相关论文
共 50 条
  • [31] A mixed integer programming approach to the tensor complementarity problem
    Shouqiang Du
    Liping Zhang
    Journal of Global Optimization, 2019, 73 : 789 - 800
  • [32] A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
    Hoai An Le Thi
    Moeini, Mahdi
    Tao Pham Dinh
    Judice, Joaquim
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 51 (03) : 1097 - 1117
  • [33] A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
    Hoai An Le Thi
    Mahdi Moeini
    Tao Pham Dinh
    Joaquim Judice
    Computational Optimization and Applications, 2012, 51 : 1097 - 1117
  • [34] APPROACH TO SOLVING DISCRETE PROGRAMMING PROBLEMS
    OVSIEVICH, BL
    POKIDOVA, BI
    ENGINEERING CYBERNETICS, 1971, 9 (06): : 1001 - +
  • [35] An approach for solving nonlinear programming problems
    Basirzadeh H.
    Kamyad A.V.
    Effati S.
    Journal of Applied Mathematics and Computing, 2002, 9 (2) : 547 - 560
  • [36] On an approach to solving nonlinear programming problems
    Bereshinskiy, T.A.
    Ostrovskiy, G.M.
    Ostrovskiy, M.G.
    Avtomatika i Telemekhanika, 1989, (01): : 78 - 86
  • [37] A null space approach for solving nonlinear complementarity problems
    Nie P.-Y.
    Acta Mathematicae Applicatae Sinica, 2006, 22 (1) : 9 - 20
  • [38] QPCOMP: A quadratic programming based solver for mixed complementarity problems
    Department of Mathematics, University of Colorado, Denver, CO 80217, United States
    不详
    Mathematical Programming, Series B, 1997, 76 (03): : 533 - 562
  • [39] QPCOMP: A quadratic programming based solver for mixed complementarity problems
    Billups, SC
    Ferris, MC
    MATHEMATICAL PROGRAMMING, 1997, 76 (03) : 533 - 562
  • [40] A generalized complementarity approach to solving real option problems
    Nagae, Takeshi
    Akamatsu, Takashi
    JOURNAL OF ECONOMIC DYNAMICS & CONTROL, 2008, 32 (06): : 1754 - 1779
12345