A Globally Optimal Portfolio for M-Sparse Sharpe Ratio Maximization

Abstract

The Sharpe ratio is an important and widely-used risk-adjusted return in financial engineering. In modern portfolio management, one may require an m-sparse (no more than m active assets) portfolio to save managerial and financial costs. However, few existing methods can optimize the Sharpe ratio with the m-sparse constraint, due to the nonconvexity and the complexity of this constraint. We propose to convert the m-sparse fractional optimization problem into an equivalent m-sparse quadratic programming problem. The semi-algebraic property of the resulting objective function allows us to exploit the Kurdyka-Lojasiewicz property to develop an efficient Proximal Gradient Algorithm (PGA) that leads to a portfolio which achieves the globally optimal m-sparse Sharpe ratio under certain conditions. The convergence rates of PGA are also provided. To the best of our knowledge, this is the first proposal that achieves a globally optimal m-sparse Sharpe ratio with a theoretically-sound guarantee.

Cite

Text

Lin et al. "A Globally Optimal Portfolio for M-Sparse Sharpe Ratio Maximization." Neural Information Processing Systems, 2024. doi:10.52202/079017-0545

Markdown

[Lin et al. "A Globally Optimal Portfolio for M-Sparse Sharpe Ratio Maximization." Neural Information Processing Systems, 2024.](https://mlanthology.org/neurips/2024/lin2024neurips-globally/) doi:10.52202/079017-0545

BibTeX

@inproceedings{lin2024neurips-globally,
  title     = {{A Globally Optimal Portfolio for M-Sparse Sharpe Ratio Maximization}},
  author    = {Lin, Yizun and Lai, Zhao-Rong and Li, Cheng},
  booktitle = {Neural Information Processing Systems},
  year      = {2024},
  doi       = {10.52202/079017-0545},
  url       = {https://mlanthology.org/neurips/2024/lin2024neurips-globally/}
}