Abstract
In this paper, we study the global optimality of polynomial portfolio optimization (PPO). The PPO is a kind of portfolio selection model with high-order moments and flexible risk preference parameters. We introduce a perturbation sample average approximation method, which can give a robust approximation of the PPO in form of linear conic optimization. The approximated problem can be solved globally with Moment-SOS relaxations. We summarize a semidefinite algorithm, which can be used to find reliable approximations of the optimal value and optimizer set of the PPO. Numerical examples are given to show the efficiency of the algorithm.
Similar content being viewed by others
References
Markowitz, H.: Portfolio selection. J. Finance 7(1), 77–91 (1952)
Jondeau, E., Rockinger, M.: Conditional volatility, skewness, and kurtosis: existence, persistence, and comovements. J. Econ. Dyn. Control 27(10), 1699–1737 (2013)
Singleton, J.C., Wingender, J.: Skewness persistence in common stock returns. J. Financ. Quanti. Anal. 21(3), 335–341 (1986)
Harvey, C.R., Siddique, A.: Conditional skewness in asset pricing tests. J. Financ. 55(3), 1263–1295 (2000)
Konno, H., Suzuki, K.: A mean-variance-skewness portfolio optimization model. J. Op. Res. Soc. Jpn 38(2), 173–187 (1995)
Davies, D.J., Kat, H.M., Lu, S.: Fund of hedge funds portfolio selection: a multiple-objective approach. J. Deriv. Hedge Funds 15(2), 91–115 (2009)
Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)
Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. IMA Vol. Math. Appl. 149, pp. 157-270. Springer, New York (2009)
Nie, J., Yang, L., Zhong, S.: Stochastic polynomial optimization. Optim. Methods Softw. 35(2), 329–347 (2020)
Markowitz, H.: Mean-variance approximations to expected utility. European J. Oper. Res. 234(2), 346–355 (2014)
Rubinstein, M.: Markowitz’s “portfolio selection’’: A fifty-year retrospective. J. Financ. 57(3), 1041–1045 (2002)
Steinbach, M.C.: Markowitz revisited: Mean-variance models in financial portfolio analysis. SIAM Rev. 43(1), 31–85 (2001)
Levy, H., Markowitz, H.M.: Approximating expected utility by a function of mean and variance. Am. Econ. Rev. 69(3), 308–317 (1979)
Maringer, D.: Parpas, P,: Global optimization of higher order moments in portfolio selection. J. Global Optim. 43(2–3), 219–230 (2009)
Black, F., Litterman, R.: Global portfolio optimization. Financ. Anal. J. 48(5), 28–43 (1992)
Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Math. Oper. Res. 28(1), 1–38 (2003)
Kolm, P.N., Tütüncü, R., Fabozzi, F.J.: 60 years of portfolio optimization: Practical challenges and current trends. European J. Oper. Res. 234(2), 356–371 (2014)
Lan, G.: First-order and stochastic optimization methods for machine learning. Springer (2020)
Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM (2021)
Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969–984 (1993)
Nie, J.: Certifying convergence of Lasserre’s hierarchy via flat truncation. Math. Program. 142(1–2), 385–510 (2013)
Nie, J.: Optimality conditions and finite convergence of Lasserre’s hierarchy. Math. Program. 146(1–2), 97–121 (2014)
Fan, J., Nie, J., Zhou, A.: Tensor eigenvalue complementarity problems. Math. Program. 170(2), 507–539 (2018)
Guo, B., Nie, J., Yang, Z.: Learning diagonal Gaussian mixture models and incomplete tensor decompositions. Vietnam J. Math. 50(2), 421–446 (2022)
Nie, J., Tang, X.: Convex generalized Nash equilibrium problems and polynomial optimization. Math. Program. 198(2), 1485–1518 (2023)
Nie, J., Yang, L., Zhong, S., Zhou, G.: Distributionally robust optimization with moment ambiguity sets. J. Sci. Comput. 94(12), 1–27 (2023)
Huang, L., Nie, J., Yuan, Y.X.: Homogenization for polynomial optimization with unbounded sets. Math. Program. 200(1), 105–145 (2023)
Qu, Z., Tang, X.: A correlative sparse Lagrange multiplier expression relaxation for polynomial optimization (2022). arXiv:2208.03979
Nie, J., Yang, Z.: The multi-objective polynomial optimization (2021). arXiv:2108.04336
Nie, J.: Moment and Polynomial Optimization. SIAM (2023)
Henrion, D., Korda, M., Lasserre, J.B.: The moment-SOS hierarchy-lectures in probability, statistics, computational geometry. World Scientific, Control and Nonlinear PDEs (2020)
Lasserre, J.B.: An introduction to polynomial and semi-algebraic optimization. Cambridge University Press, Cambridge (2015)
Curto, R.E., Fialkow, L.A.: Truncated \(K\)-moment problems in several variables. J. Operator Theory 54(1), 189–226 (2005)
Helton, J., Nie, J.: A semidefinite approach for truncated \(K\)-moment problem. Found. Compu. Math. 12(6), 851–881 (2012)
Nie, J.: The \({\cal{A} }\)-truncated \(K\)-moment problem. Found. Compu. Math. 14(6), 1243–1276 (2014)
Ross, S.: A First Course in Probability. Pearson (2010)
Henrion, D., Lasserre, J.B., Löfberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4–5), 761–779 (2009)
Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1–4), 625–653 (1999)
Acknowledgements
The authors are grateful to the editor and the reviewers for their helpful comments and suggestions, which have improved the presentation of the paper.
Author information
Authors and Affiliations
Contributions
L. Yang and S.-H. Zhong wrote this paper and designed the algorithm and finished the theoretical proof. Y. Yang performed the experiments. All authors have read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no conflict of interest. The funding sponsors had no role in the design of the study; in the collection, analysis or interpretation of data; in the writing of the manuscript; nor in the decision to publish the results.
Additional information
Liu Yang is supported by the National Natural Science Foundation of China (Nos.12071399 and 12171145), Project of Scientific Research Fund of Hunan Provincial Science and Technology Department (No.2018WK4006), Project of Hunan National Center for Applied Mathematics (No.2020ZYT003).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yang, L., Yang, Y. & Zhong, SH. Global Optimization for the Portfolio Selection Model with High-Order Moments. J. Oper. Res. Soc. China (2023). https://doi.org/10.1007/s40305-023-00519-8
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40305-023-00519-8
Keywords
- Portfolio selection model
- High-order moments
- Moment-SOS relaxation
- Perturbation sample average approximation