.png){kind=icon}
返回
Robust ranking and portfolio optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.03.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The portfolio optimization problem has attracted researchers from many disciplines to resolve the issue of poor out-of-sample performance due to estimation errors in the expected returns. A practical method for portfolio construction is to use assets' ordering information, expressed in the form of preferences over the stocks, instead of the exact expected returns. Due to the fact that the ranking itself is often described with uncertainty, we introduce a generic robust ranking model and apply it to portfolio optimization. In this problem, there are n objects whose ranking is in a discrete uncertainty set. We want to find a weight vector that maximizes some generic objective function for the worst realization of the ranking. This robust ranking problem is a mixed integer minimax problem and is very difficult to solve in general. To solve this robust ranking problem, we apply the constraint generation method, where constraints are efficiently generated by solving a network flow problem. For empirical tests, we use post-earnings-announcement drifts to obtain ranking uncertainty sets for the stocks in the DJIA index. We demonstrate that our robust portfolios produce smaller risk compared to their non-robust counterparts. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Uncertainty modelling
Network flows
Portfolio optimization
Ranking
Mixed integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
On optimal sample checkpoint for energy efficient cooperative spectrum sensing能量高效协作频谱感知的最优采样检查点研究
PREAI
分享收藏Solving non-linear portfolio optimization problems with the primal-dual interior point method用原-对偶内点法求解非线性投资组合优化问题
PREAI
分享收藏Perceptions of violence and fear of school attendance among junior high school students in Israel以色列初中学生对暴力的看法和对上学的恐惧
PREAI
分享收藏
查看更多内容