Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png SN Operations Research Forum Springer Journals

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

Loading next page...
 
/lp/springer-journals/time-varying-mean-variance-portfolio-selection-under-transaction-costs-dZnxmm0anI

References (41)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG part of Springer Nature 2021
eISSN
2662-2556
DOI
10.1007/s43069-021-00060-5
Publisher site
See Article on Publisher Site

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.

Journal

SN Operations Research ForumSpringer Journals

Published: Mar 29, 2021

There are no references for this article.