arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.4488math.OCcs.NAmath.NA
收藏

期望效用优化——变分法方法

Expected Utility Optimization - Calculus of Variations Approach

Khoa Tran

AI总结:

本文采用变分法推导Merton问题中的Hamilton-Jacobi方程,证明了变分法能保证最优解满足该方程,而动态规划方法不能。

摘要:

在本文中,我将使用变分法方法推导效用优化理论中Merton问题的Hamilton-Jacobi方程。对于随机控制问题,动态规划已被用作标准方法。据我所知,还没有人使用变分法来解决这个问题。此外,虽然动态规划方法不能保证最优解满足HJ方程,但变分法方法可以。请注意,这是本文的初稿,可能包含许多缺陷。

英文摘要:

In this paper, I'll derive the Hamilton-Jacobi (HJ) equation for Merton's problem in Utility Optimization Theory using a Calculus of Variations (CoV) Approach. For stochastic control problems, Dynamic Programming (DP) has been used as a standard method. To the best of my knowledge, no one has used CoV for this problem. In addition, while the DP approach cannot guarantee that the optimum satisfies the HJ equation, the CoV approach does. Be aware that this is the first draft of this paper and many flaws might be introduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑