IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v85y2023i1d10.1007_s10589-023-00452-9.html
   My bibliography  Save this article

A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint

Author

Listed:
  • Zhijun Xu

    (Zhejiang University of Technology)

  • Jing Zhou

    (Zhejiang University of Technology)

Abstract

The portfolio rebalancing with transaction costs plays an important role in both theoretical analyses and commercial applications. This paper studies a standard portfolio problem that is subject to an additional orthogonality constraint guaranteeing that buying and selling a same security do not occur at the same time point. Incorporating the orthogonality constraint into the portfolio problem leads to a quadratic programming problem with linear complementarity constraints. We derive an enhanced simultaneous diagonalization based second order cone programming (ESDSOCP) relaxation by taking advantage of the feature that the objective and constraint matrices are commutative. The ESDSOCP relaxation has lower computational complexity than the semi-definite programming (SDP) relaxation, and it is proved to be as tight as the SDP relaxation. It is worth noting that the original simultaneous diagonalization based second order cone programming relaxation (SDSOCP) is only guaranteed to be as tight as the SDP relaxation on condition that the objective matrix is positive definite. Note that the objective matrix in this paper is positive semidefinite (while not positive definite), thus the ESDSOCP relaxation outperforms the original SDSOCP relaxation. We further design a branch and bound algorithm based on the ESDSOCP relaxation to find the global optimal solution and computational results illustrate the effectiveness of the proposed algorithm.

Suggested Citation

  • Zhijun Xu & Jing Zhou, 2023. "A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint," Computational Optimization and Applications, Springer, vol. 85(1), pages 247-261, May.
    • Handle: RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00452-9
    DOI: 10.1007/s10589-023-00452-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00452-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-023-00452-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Miguel Lobo & Maryam Fazel & Stephen Boyd, 2007. "Portfolio optimization with linear and fixed transaction costs," Annals of Operations Research, Springer, vol. 152(1), pages 341-365, July.
    2. Roberto Baviera & Giulia Bianchi, 2021. "Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach," Journal of Global Optimization, Springer, vol. 81(2), pages 469-491, October.
    3. Samuel Burer & Sunyoung Kim & Masakazu Kojima, 2014. "Faster, but weaker, relaxations for quadratically constrained quadratic programs," Computational Optimization and Applications, Springer, vol. 59(1), pages 27-45, October.
    4. Zinoviy Landsman & Udi Makov, 2016. "Minimization of a Function of a Quadratic Functional with Application to Optimal Portfolio Selection," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 308-322, July.
    5. González-Díaz, Julio & González-Rodríguez, Brais & Leal, Marina & Puerto, Justo, 2021. "Global optimization for bilevel portfolio design: Economic insights from the Dow Jones index," Omega, Elsevier, vol. 102(C).
    6. Saeed Marzban & Masoud Mahootchi & Alireza Arshadi Khamseh, 2015. "Developing a multi-period robust optimization model considering American style options," Annals of Operations Research, Springer, vol. 233(1), pages 305-320, October.
    7. Guo, Sini & Gu, Jia-Wen & Ching, Wai-Ki, 2021. "Adaptive online portfolio selection with transaction costs," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1074-1086.
    8. Jianjun Gao & Duan Li, 2013. "Optimal Cardinality Constrained Portfolio Selection," Operations Research, INFORMS, vol. 61(3), pages 745-761, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    2. Adrian Gepp & Geoff Harris & Bruce Vanstone, 2020. "Financial applications of semidefinite programming: a review and call for interdisciplinary research," Accounting and Finance, Accounting and Finance Association of Australia and New Zealand, vol. 60(4), pages 3527-3555, December.
    3. Samim Ghamami & Paul Glasserman, 2019. "Submodular Risk Allocation," Management Science, INFORMS, vol. 65(10), pages 4656-4675, October.
    4. Lili Pan & Ziyan Luo & Naihua Xiu, 2017. "Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 104-118, October.
    5. Gupta, Pankaj & Mittal, Garima & Mehlawat, Mukesh Kumar, 2013. "Expected value multiobjective portfolio rebalancing model with fuzzy parameters," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 190-203.
    6. Shinji Yamada & Akiko Takeda, 2018. "Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization," Journal of Global Optimization, Springer, vol. 71(2), pages 313-339, June.
    7. Nonthachote Chatsanga & Andrew J. Parkes, 2016. "International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints," Papers 1611.01463, arXiv.org.
    8. Ashrafi, Hedieh & Thiele, Aurélie C., 2021. "A study of robust portfolio optimization with European options using polyhedral uncertainty sets," Operations Research Perspectives, Elsevier, vol. 8(C).
    9. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    10. Sehgal, Ruchika & Sharma, Amita & Mansini, Renata, 2023. "Worst-case analysis of Omega-VaR ratio optimization model," Omega, Elsevier, vol. 114(C).
    11. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    12. Eric Benhamou & Beatrice Guez, 2018. "Incremental Sharpe and other performance ratios," Journal of Statistical and Econometric Methods, SCIENPRESS Ltd, vol. 7(4), pages 1-2.
    13. Sourish Das & Rituparna Sen, 2021. "Sparse Portfolio Selection via Bayesian Multiple Testing," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 83(2), pages 585-617, November.
    14. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    15. Nicole Bauerle & Tomer Shushi, 2019. "Risk Management with Tail Quasi-Linear Means," Papers 1902.06941, arXiv.org, revised Jan 2020.
    16. Andrea Scozzari & Fabio Tardella & Sandra Paterlini & Thiemo Krink, 2013. "Exact and heuristic approaches for the index tracking problem with UCITS constraints," Annals of Operations Research, Springer, vol. 205(1), pages 235-250, May.
    17. Eduardo Bered Fernandes Vieira & Tiago Pascoal Filomena, 2020. "Liquidity Constraints for Portfolio Selection Based on Financial Volume," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 1055-1077, December.
    18. Rubén Ruiz-Torrubiano & Alberto Suárez, 2009. "A hybrid optimization approach to index tracking," Annals of Operations Research, Springer, vol. 166(1), pages 57-71, February.
    19. Wei Chen & Yun Wang & Mukesh Kumar Mehlawat, 2018. "A hybrid FA–SA algorithm for fuzzy portfolio selection with transaction costs," Annals of Operations Research, Springer, vol. 269(1), pages 129-147, October.
    20. Kapteyn, Arie & Teppa, Federica, 2011. "Subjective measures of risk aversion, fixed costs, and portfolio choice," Journal of Economic Psychology, Elsevier, vol. 32(4), pages 564-580, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00452-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.