北京雁栖湖应用数学研究院 北京雁栖湖应用数学研究院

  • 关于我们
    • 院长致辞
    • 理事会
    • 协作机构
    • 参观来访
  • 人员
    • 管理层
    • 科研人员
    • 博士后
    • 来访学者
    • 行政团队
  • 学术研究
    • 研究团队
    • 公开课
    • 讨论班
  • 招生招聘
    • 教研人员
    • 博士后
    • 学生
  • 会议
    • 学术会议
    • 工作坊
    • 论坛
  • 学院生活
    • 住宿
    • 交通
    • 配套设施
    • 周边旅游
  • 新闻
    • 新闻动态
    • 通知公告
    • 资料下载
关于我们
院长致辞
理事会
协作机构
参观来访
人员
管理层
科研人员
博士后
来访学者
行政团队
学术研究
研究团队
公开课
讨论班
招生招聘
教研人员
博士后
学生
会议
学术会议
工作坊
论坛
学院生活
住宿
交通
配套设施
周边旅游
新闻
新闻动态
通知公告
资料下载
清华大学 "求真书院"
清华大学丘成桐数学科学中心
清华三亚国际数学论坛
上海数学与交叉学科研究院
BIMSA > BIMSA Digital Economy Lab Seminar High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sum-of-Square Theory
High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sum-of-Square Theory
组织者
韩立岩 , 李振 , 龙飞 , 汤珂 , 王玉
演讲者
王亚娟
时间
2025年01月06日 15:20 至 16:20
地点
A3-2-303
线上
Zoom 230 432 7880 (BIMSA)
摘要
The Mean-Variance-Skewness-Kurtosis (MVSK) high-order moment portfolio optimization model is a nonconvex quartic polynomial minimization problem over a standard simplex. This problem can be formulated as a Difference-of-Convex (DC) program. To tackle this, we propose a novel DC formulation for the MVSK model based on the Difference-of-Convex-Sums-of-Squares (DC-SOS). The classical DCA algorithm is applied to solve this formulation, and we further develop an accelerated version, Boosted DCA (BDCA), designed for general DC programs with convex constraints. The acceleration of BDCA is achieved through a line search strategy, such as an Armijo-type inexact line search, along the DC descent direction based on consecutive DCA iterations. We provide rigorous convergence analysis to establish the theoretical foundation of BDCA. Two decomposition approaches, DC-SOS and projective DC decomposition, are tested, demonstrating the versatility of the method. Numerical simulations using both synthetic and real-world portfolio datasets validate the effectiveness of BDCA. The method is benchmarked against solvers like KNITRO, FILTERSD, IPOPT, and MATLAB fmincon, showcasing superior computational efficiency and robustness. Notably, the DC-SOS decomposition provides a better convex over-approximation for polynomials, significantly reducing the number of iterations required for DCA and BDCA. BDCA consistently achieves the best numerical results with fewer iterations compared to the classical DCA. The BDCA method proves to be an advanced and practical tool for high-order moment portfolio optimization. Its enhanced convergence rates and improved solution quality highlight its applicability in solving complex portfolio optimization problems effectively.
演讲者介绍
Yajuan Wang is a postdoctoral researcher in Strategic Management at the School of Management, Fudan University, and an intern at BIMSA. She earned her Ph.D. in Strategic Management from Shanghai University of Finance and Economics. Her research interests span strategic management, human resources, and finance, with a focus on dynamic competition, corporate innovation, top management teams (TMT), talent resource development, venture capital and portfolio investment.
北京雁栖湖应用数学研究院
CONTACT

No. 544, Hefangkou Village Huaibei Town, Huairou District Beijing 101408

北京市怀柔区 河防口村544号
北京雁栖湖应用数学研究院 101408

Tel. 010-60661855
Email. administration@bimsa.cn

版权所有 © 北京雁栖湖应用数学研究院

京ICP备2022029550号-1

京公网安备11011602001060 京公网安备11011602001060