A Comparison of Parametric Approximation Techniques to Continuous-Time Stochastic Dynamic Programming Problems
| dc.creator | Kompas, Tom | |
| dc.creator | Chu, Long | |
| dc.date | 2017-04-01T19:57:16Z | |
| dc.date.accessioned | 2026-07-09T05:22:20Z | |
| dc.description | We compare three parametric techniques to approximate Hamilton-Jacobi-Bellman equations via unidimensional and multidimensional problems. The linear programming technique is very efficient for unidimensional problems and offers a balance of speed and accuracy for multidimensional problems. A comparable projection technique is shown to be slow, but has stable accuracy, whereas a perturbation technique has the least accuracy although its speed suffers least from the curse of dimensionality. The linear programming technique is also shown to be suitable for problems in resource management, including applications to biosecurity and marine reserve design. | |
| dc.identifier | doi:10.22004/ag.econ.95044 | |
| dc.identifier | https://ageconsearch.umn.edu/record/95044/files/A%20Comparison%20of%20Parametric%20Approximation%20Techniques%20to%20Continuous-Time%20Stochastic%20Dynamic%20Programming%20Problems.pdf | |
| dc.identifier | http://ageconsearch.umn.edu/record/95044 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/562777 | |
| dc.language | eng | |
| dc.publisher | ||
| dc.source | http://ageconsearch.umn.edu/record/95044 | |
| dc.title | A Comparison of Parametric Approximation Techniques to Continuous-Time Stochastic Dynamic Programming Problems | |
| dc.type | Text |