Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)

Vasilios N. Katsikis; Spyridon D. Mourtas; Predrag S. Stanimirović; Shuai Li; Cao, Xinwei

Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)

Citation:

Katsikis, V. N., Mourtas, S. D., Stanimirović, P. S., Li, S., & Cao, X. (2021). Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS). Operations Research Forum, 2(2), 18. presented at the 2021. Copy at http://www.tinyurl.com/yeyvf4c7

Abstract:

The Markowitz mean-variance portfolio selection is widely acclaimed as a very important investment strategy. A popular option to solve the static mean-variance portfolio selection (MVPS) problem is based on the use of quadratic programming (QP) methods. On the other hand, the static portfolio selection under transaction costs (PSTC) problem is usually approached with nonlinear programming (NLP) methods. In this article, we define and study the time-varying mean-variance portfolio selection under transaction costs and cardinality constraint (TV-MVPSTC-CC) problem as a time-varying nonlinear programming (TVNLP) problem. The TV-MVPSTC-CC also comprises the properties of a moving average. These properties make the TV-MVPSTC-CC an even greater analysis tool suitable to evaluate investments and identify trading opportunities across a continuous-time period. Using the Beetle Antennae Search (BAS) algorithm, we also provide an online solution to the static NLP problem. To the best of our knowledge, this is an innovative approach that incorporates modern meta-heuristic optimization techniques to provide an online, thus more realistic, solution to the TV-MVPSTC-CC problem. In this way, we present an online solution to a time-varying financial problem while eliminating the restrictions of static methods. Our approach is also verified by numerical experiments and computer simulations as an excellent alternative to traditional approaches.

Publisher's Version

Contact Details

National and Kapodistrian University of Athens
Office: 601 (Floor 6)
Phone number: (+30) 210-3689489
Address: Sofokleous 1, 10559, Athens, Greece
Email: vaskatsikis@econ.uoa.gr
URL: http://scholar.uoa.gr/vaskatsikis
Google Scholar: CLICK ME!
Research Gate: CLICK ME!
Orchid Number: CLICK ME!

<embed>

Recent Publications

Cao, X., Li, S., Katsikis, V., Khan, A. T., He, H., Liu, Z., Zhang, L., et al. (2024). Empowering financial futures: Large language models in the modern financial landscape. EAI Endorsed Transactions on AI and Robotics, 3. presented at the Jul. Website

Stanimirović, P. S., Mourtas, S. D., Mosić, D., Katsikis, V. N., Cao, X., & Li, S. (2024). A Zeroing Neural Network Approach for Calculating Time-Varying G-Outer Inverse of Arbitrary Matrix. IEEE Transactions on Neural Networks and Learning Systems, 1-10.

Balios, D., Katsikis, V. N., Naoum, V. C., & Zaroulea, T. (2024). The effect of industry level characteristics and cross-country differences on earnings management: A European comparative perspective. Journal of Governance & Regulation, 13(2), 403-418. Publisher's Version

Jerbi, H., Al-Darraji, I., Albadran, S., Aoun, S. B., Simos, T. E., Mourtas, S. D., & Katsikis, V. N. (2024). Solving quaternion nonsymmetric algebraic Riccati equations through zeroing neural networks. AIMS Mathematics, 9, 5794-5809. Website

Mourtas, S. D., Katsikis, V. N., Stanimirović, P. S., & Kazakovtsev, L. A. (2024). Credit and Loan Approval Classification Using a Bio-Inspired Neural Network. Biomimetics, 9. Website Abstract

Numerous people are applying for bank loans as a result of the banking industry’s expansion, but because banks only have a certain amount of assets to lend to, they can only do so to a certain number of applicants. Therefore, the banking industry is very interested in finding ways to reduce the risk factor involved in choosing the safe applicant in order to save lots of bank resources. These days, machine learning greatly reduces the amount of work needed to choose the safe applicant. Taking this into account, a novel weights and structure determination (WASD) neural network has been built to meet the aforementioned two challenges of credit approval and loan approval, as well as to handle the unique characteristics of each. Motivated by the observation that WASD neural networks outperform conventional back-propagation neural networks in terms of sluggish training speed and being stuck in local minima, we created a bio-inspired WASD algorithm for binary classification problems (BWASD) for best adapting to the credit or loan approval model by utilizing the metaheuristic beetle antennae search (BAS) algorithm to improve the learning procedure of the WASD algorithm. Theoretical and experimental study demonstrate superior performance and problem adaptability. Furthermore, we provide a complete MATLAB package to support our experiments together with full implementation and extensive installation instructions.

He, Y., Dong, X., Simos, T. E., Mourtas, S. D., Katsikis, V. N., Lagios, D., Zervas, P., et al. (2024). A bio-inspired weights and structure determination neural network for multiclass classification: Applications in occupational classification systems. AIMS Mathematics, 9, 2411-2434. Website

Jerbi, H., Alshammari, O., Aoun, S. B., Kchaou, M., Simos, T. E., Mourtas, S. D., & Katsikis, V. N. (2024). Hermitian Solutions of the Quaternion Algebraic Riccati Equations through Zeroing Neural Networks with Application to Quadrotor Control. Mathematics, 12. Website Abstract

The stability of nonlinear systems in the control domain has been extensively studied using different versions of the algebraic Riccati equation (ARE). This leads to the focus of this work: the search for the time-varying quaternion ARE (TQARE) Hermitian solution. The zeroing neural network (ZNN) method, which has shown significant success at solving time-varying problems, is used to do this. We present a novel ZNN model called ’ZQ-ARE’ that effectively solves the TQARE by finding only Hermitian solutions. The model works quite effectively, as demonstrated by one application to quadrotor control and three simulation tests. Specifically, in three simulation tests, the ZQ-ARE model finds the TQARE Hermitian solution under various initial conditions, and we also demonstrate that the convergence rate of the solution can be adjusted. Furthermore, we show that adapting the ZQ-ARE solution to the state-dependent Riccati equation (SDRE) technique stabilizes a quadrotor’s flight control system faster than the traditional differential-algebraic Riccati equation solution.

Gerontitis, D., Mo, C., Stanimirović, P. S., & Katsikis, V. N. (2024). Improved zeroing neural models based on two novel activation functions with exponential behavior. Theoretical Computer Science, 986, 114328. Website Abstract

A family of zeroing neural networks based on new nonlinear activation functions is proposed for solving various time-varying linear matrix equations (TVLME). The proposed neural network dynamical systems, symbolized as Li-VPZNN1 and Li-VPZNN2, include an exponential parameter in nonlinear activation function (AF) that leads to faster convergence to the theoretical result compared to previous categories of nonlinearly activated neural networks. Theoretical analysis as well as numerical tests in MATLAB's environment confirm the efficiency and accelerated convergence property of the novel dynamics.

Stanimirović, P. S., Mourtas, S. D., Mosić, D., Katsikis, V. N., Cao, X., & Li, S. (2024). Zeroing neural network approaches for computing time-varying minimal rank outer inverse. Applied Mathematics and Computation, 465, 128412. Website Abstract

Generalized inverses are extremely effective in many areas of mathematics and engineering. The zeroing neural network (ZNN) technique, which is currently recognized as the state-of-the-art approach for calculating the time-varying Moore-Penrose matrix inverse, is investigated in this study as a solution to the problem of calculating the time-varying minimum rank outer inverse (TV-MROI) with prescribed range and/or TV-MROI with prescribed kernel. As a result, four novel ZNN models are introduced for computing the TV-MROI, and their efficiency is examined. Numerical tests examine and validate the effectiveness of the introduced ZNN models for calculating TV-MROI with prescribed range and/or prescribed kernel.

Cao, X., Peng, C., Zheng, Y., Li, S., Ha, T. T., Shutyaev, V., Katsikis, V. N., et al. (2024). Neural Networks for Portfolio Analysis in High-Frequency Trading. IEEE Transactions on Neural Networks and Learning Systems, 1-10.

2024 (10)
2023 (20)
2022 (20)
2021 (16)
2020 (14)
2019 (9)
2018 (5)
2017 (6)
2016 (7)
2015 (3)

<embed>

Vasilios Katsikis

Professor, Economics

Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)

Citation:

Abstract:

Contact Details

Recent Publications

Publications per year