On Accelerating Large-Scale Robust Portfolio Optimization
<|reference_start|>On Accelerating Large-Scale Robust Portfolio Optimization: Solving large-scale robust portfolio optimization problems is challenging due to the high computational demands associated with an increasing number of assets, the amount of data considered, and market uncertainty. To address this issue, we propose an extended supporting hyperplane approximation approach for efficiently solving a class of distributionally robust portfolio problems for a general class of additively separable utility functions and polyhedral ambiguity distribution set, applied to a large-scale set of assets. Our technique is validated using a large-scale portfolio of the S&P 500 index constituents, demonstrating robust out-of-sample trading performance. More importantly, our empirical studies show that this approach significantly reduces computational time compared to traditional concave Expected Log-Growth (ELG) optimization, with running times decreasing from several thousand seconds to just a few. This method provides a scalable and practical solution to large-scale robust portfolio optimization, addressing both theoretical and practical challenges.<|reference_end|>
@article{hsieh2024on,
    title={On Accelerating Large-Scale Robust Portfolio Optimization},
    author={Chung-Han Hsieh and Jie-Ling Lu},
    journal={arXiv preprint arXiv:2408.07879},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.07879},
    primaryClass={q-fin.CP cs.SY eess.SY math.OC q-fin.PM}
}