1995
DOI: 10.2307/2527206
|View full text |Cite
|
Sign up to set email alerts
|

Nonconvexities in Stochastic Control Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
23
0

Year Published

1999
1999
2014
2014

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 31 publications
(24 citation statements)
references
References 7 publications
1
23
0
Order By: Relevance
“…(1982), Mizrach (1991), Amman and Kendrick (1995) and others). An advantage of the algorithm used here is that it approximates policy and value functions for this nonlinear dynamic programming problem over a wide range of the state space and is flexible to allow for nondifferentiabilities in the value function and discontinuities in the optimal policy.…”
mentioning
confidence: 98%
“…(1982), Mizrach (1991), Amman and Kendrick (1995) and others). An advantage of the algorithm used here is that it approximates policy and value functions for this nonlinear dynamic programming problem over a wide range of the state space and is flexible to allow for nondifferentiabilities in the value function and discontinuities in the optimal policy.…”
mentioning
confidence: 98%
“…See for example Tse and Bar-Shalom (1973), Kendrick (1981), Kendrick (1982), Mizrach (1991), Amman andKendrick (1995), Tucci (1996)). …”
mentioning
confidence: 99%
“…As mentioned above, numerical approaches to solving this class of optimal learning problems have been studied extensively and for some time in engineering. Termed \dual control", these methods have been further developed and applied to economic problems by Kendrick (1981) and, Norman (1976), Mizrach (1991), Amman and Kendrick (1995) and others. There are several important dierences between dual control and the dynamic programming algorithm used here: (i) while the dual control algorithm typically involves a rst-or second-order linear approximation, the DP algorithm used here directly takes into account the nonlinearity of the updating equations which are at the center of the learning problem; (ii) while the dual control algorithm approximates ex-post payos for a given initial belief about the unknown parameters for alternative sequences of shocks as in Monte Carlo simulations, the DP algorithm used here approximates ex-ante payos and policies for a range of initial beliefs and any possible sequence of shocks.…”
mentioning
confidence: 99%
“…As we have related elsewhere, Kendrick (2005), in the early work on dual control we did not expect that the cost-to-go function would exhibit nonconvexities and we did not make any allowance for this. However, we accidentally discovered that local optima existed in the cost-to-go functions, Kendrick (1978), Norman, Norman and Palash (1979), and this was confirmed by theoretical research by Mizrach (1991) and by numerical research by Amman and Kendrick (1995). Also, the presence of the nonconvexities has been confirmed by Wieland (2000a) using a different solution method, namely value function iteration.…”
Section: Non-convexitiesmentioning
confidence: 83%