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

Zhijun Xu and Jing Zhou ()
Additional contact information
Zhijun Xu: Zhejiang University of Technology
Jing Zhou: Zhejiang University of Technology

Computational Optimization and Applications, 2023, vol. 85, issue 1, No 8, 247-261

Abstract: 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.

Keywords: Portfolio optimization; Second order cone programming relaxation; Semi-definite programming relaxation; Branch and bound algorithm; Simultaneous diagonalization; Orthogonality constraint; 90C26; 90C33; 90C34 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00452-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00452-9

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-023-00452-9

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().