期刊文献+

Matrix decomposition and Lagrangian dual method for discrete portfolio optimization under concave transaction costs

Matrix decomposition and Lagrangian dual method for discrete portfolio optimization under concave transaction costs
下载PDF
导出
摘要 In this paper, the discrete mean-variance model is considered for portfolio selection under concave transaction costs. By using the Cholesky decomposition technique, the convariance matrix to obtain a separable mixed integer nonlinear optimization problem is decomposed. A brand-and-bound algorithm based on Lagrangian relaxation is then proposed. Computational results are reported for test problems with the data randomly generated and those from the US stock market. In this paper, the discrete mean-variance model is considered for portfolio selection under concave transaction costs. By using the Cholesky decomposition technique, the convariance matrix to obtain a separable mixed integer nonlinear optimization problem is decomposed. A brand-and-bound algorithm based on Lagrangian relaxation is then proposed. Computational results are reported for test problems with the data randomly generated and those from the US stock market.
出处 《Journal of Shanghai University(English Edition)》 CAS 2009年第2期119-122,共4页 上海大学学报(英文版)
基金 supported by the National Natural Science Foundation of China (Grant Nos.70671064,70518001)
关键词 portfolio optimization Cholesky decomposition concave transaction costs Lagrangian relaxation brand-andbound portfolio optimization, Cholesky decomposition, concave transaction costs, Lagrangian relaxation, brand-andbound
  • 相关文献

参考文献1

二级参考文献1

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部