This paper studies the optimal portfolio allocation of a fund manager when he bases decisions on both the absolute level of terminal relative performance and the change value of terminal relative performance compariso...This paper studies the optimal portfolio allocation of a fund manager when he bases decisions on both the absolute level of terminal relative performance and the change value of terminal relative performance comparison to a predefined reference point. We find the optimal investment strategy by maximizing a weighted average utility of a concave utility and an Sshaped utility via a concavification technique and the martingale method. Numerical results are carried out to show the impact of the extent to which the manager pays attention to the change of relative performance related to the reference point on the optimal terminal relative performance.展开更多
In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and con...In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them.展开更多
基金Supported by the National Natural Science Foundation of China(12071335)the Humanities and Social Science Research Projects in Ministry of Education(20YJAZH025).
文摘This paper studies the optimal portfolio allocation of a fund manager when he bases decisions on both the absolute level of terminal relative performance and the change value of terminal relative performance comparison to a predefined reference point. We find the optimal investment strategy by maximizing a weighted average utility of a concave utility and an Sshaped utility via a concavification technique and the martingale method. Numerical results are carried out to show the impact of the extent to which the manager pays attention to the change of relative performance related to the reference point on the optimal terminal relative performance.
基金This research is supported by the National Natural Science Foundation of China(Grant 10271073).
文摘In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them.
