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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    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. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    5. 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.
    6. 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.
    7. 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.
    8. Seyoung Park & Eun Ryung Lee & Sungchul Lee & Geonwoo Kim, 2019. "Dantzig Type Optimization Method with Applications to Portfolio Selection," Sustainability, MDPI, vol. 11(11), pages 1-32, June.
    9. Nonthachote Chatsanga & Andrew J. Parkes, 2016. "International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints," Papers 1611.01463, arXiv.org.
    10. Xiao, Helu & Zhou, Zhongbao & Ren, Teng & Liu, Wenbin, 2022. "Estimation of portfolio efficiency in nonconvex settings: A free disposal hull estimator with non-increasing returns to scale," Omega, Elsevier, vol. 111(C).
    11. Fereydooni, Ali & Barak, Sasan & Asaad Sajadi, Seyed Mehrzad, 2024. "A novel online portfolio selection approach based on pattern matching and ESG factors," Omega, Elsevier, vol. 123(C).
    12. Michele Costola & Bertrand Maillet & Zhining Yuan & Xiang Zhang, 2024. "Mean–variance efficient large portfolios: a simple machine learning heuristic technique based on the two-fund separation theorem," Annals of Operations Research, Springer, vol. 334(1), pages 133-155, March.
    13. 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).
    14. Fatma Kılınç-Karzan, 2016. "On Minimal Valid Inequalities for Mixed Integer Conic Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 477-510, May.
    15. 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.
    16. N. Krejić & E. H. M. Krulikovski & M. Raydan, 2023. "A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization," SN Operations Research Forum, Springer, vol. 4(4), pages 1-24, December.
    17. Yuichi Takano & Keisuke Nanjo & Noriyoshi Sukegawa & Shinji Mizuno, 2015. "Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs," Computational Management Science, Springer, vol. 12(2), pages 319-340, April.
    18. Nikita Boyko & Timofey Turko & Vladimir Boginski & David E. Jeffcoat & Stanislav Uryasev & Grigoriy Zrazhevsky & Panos M. Pardalos, 2011. "Robust multi-sensor scheduling for multi-site surveillance," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 35-51, July.
    19. Kelsey Maass & Minsun Kim & Aleksandr Aravkin, 2022. "A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1366-1386, May.
    20. Giorgio Arici & Marco Dalai & Riccardo Leonardi & Arnaldo Spalvieri, 2018. "A Communication Theoretic Interpretation of Modern Portfolio Theory Including Short Sales, Leverage and Transaction Costs," JRFM, MDPI, vol. 12(1), pages 1-11, December.

    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.