IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v385y2020ics0096300320304148.html
   My bibliography  Save this article

Time-varying minimum-cost portfolio insurance under transaction costs problem via Beetle Antennae Search Algorithm (BAS)

Author

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

Abstract

Portfolio insurance is a hedging strategy which is used to limit portfolio losses without having to sell off stock when stocks decline in value. Consequently, the minimization of the costs related to portfolio insurance is a very important investment strategy. On the one hand, a popular option to solve the static minimum-cost portfolio insurance problem is based on the use of linear programming (LP) methods. On the other hand, the static portfolio selection under transaction costs (PSTC) problem is usually approached by nonlinear programming (NLP) methods. In this article, we define and study the time-varying minimum-cost portfolio insurance under transaction costs (TV-MCPITC) problem in the form of a time-varying nonlinear programming (TV-NLP) problem. Using the Beetle Antennae Search (BAS) algorithm, we also provide an online solution to the static NLP problem. The online solution to a time-varying financial problem is a great technical analysis tool and along with fundamental analysis will enable the investors to make better decisions. To the best of our knowledge, an approach that incorporates modern meta-heuristic optimization techniques to provide a more realistic online solution to the TV-MCPITC problem is original. In this way, by presenting an online solution to a time-varying financial problem we highlight the limitations of static methods. Our approach is also verified by numerical experiments and computer simulations as an excellent alternative to conventional MATLAB methods.

Suggested Citation

  • Katsikis, Vasilios N. & Mourtas, Spyridon D. & Stanimirović, Predrag S. & Li, Shuai & Cao, Xinwei, 2020. "Time-varying minimum-cost portfolio insurance under transaction costs problem via Beetle Antennae Search Algorithm (BAS)," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    • Handle: RePEc:eee:apmaco:v:385:y:2020:i:c:s0096300320304148
    DOI: 10.1016/j.amc.2020.125453
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304148
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125453?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. Aliprantis, C. D. & Brown, D. J. & Werner, J., 2000. "Minimum-cost portfolio insurance," Journal of Economic Dynamics and Control, Elsevier, vol. 24(11-12), pages 1703-1719, October.
    2. Katsikis, Vasilios N. & Mourtas, Spyridon D., 2019. "A heuristic process on the existence of positive bases with applications to minimum-cost portfolio insurance in C[a, b]," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 221-244.
    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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Simos, Theodore E. & Katsikis, Vasilios N. & Mourtas, Spyridon D., 2022. "Multi-input bio-inspired weights and structure determination neuronet with applications in European Central Bank publications," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 193(C), pages 451-465.
    2. Vasilios N. Katsikis & Spyridon D. Mourtas & Predrag S. Stanimirović & Shuai Li & Xinwei Cao, 2021. "Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)," SN Operations Research Forum, Springer, vol. 2(2), pages 1-26, June.
    3. Katsikis, Vasilios N. & Mourtas, Spyridon D. & Stanimirović, Predrag S. & Li, Shuai & Cao, Xinwei, 2023. "Time-varying minimum-cost portfolio insurance problem via an adaptive fuzzy-power LVI-PDNN," Applied Mathematics and Computation, Elsevier, vol. 441(C).
    4. Spyridon D. Mourtas & Vasilios N. Katsikis, 2022. "V-Shaped BAS: Applications on Large Portfolios Selection Problem," Computational Economics, Springer;Society for Computational Economics, vol. 60(4), pages 1353-1373, December.

    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. Vasilios N. Katsikis & Spyridon D. Mourtas & Predrag S. Stanimirović & Shuai Li & Xinwei Cao, 2021. "Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)," SN Operations Research Forum, Springer, vol. 2(2), pages 1-26, June.
    2. Vladislav N. Kovalnogov & Ruslan V. Fedorov & Dmitry A. Generalov & Andrey V. Chukalin & Vasilios N. Katsikis & Spyridon D. Mourtas & Theodore E. Simos, 2022. "Portfolio Insurance through Error-Correction Neural Networks," Mathematics, MDPI, vol. 10(18), pages 1-14, September.
    3. Vasilios N. Katsikis & Spyridon D. Mourtas, 2020. "ORPIT: A Matlab Toolbox for Option Replication and Portfolio Insurance in Incomplete Markets," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 711-721, December.
    4. Katsikis, Vasilios N. & Mourtas, Spyridon D. & Stanimirović, Predrag S. & Li, Shuai & Cao, Xinwei, 2023. "Time-varying minimum-cost portfolio insurance problem via an adaptive fuzzy-power LVI-PDNN," Applied Mathematics and Computation, Elsevier, vol. 441(C).
    5. Spyridon D. Mourtas & Vasilios N. Katsikis, 2022. "V-Shaped BAS: Applications on Large Portfolios Selection Problem," Computational Economics, Springer;Society for Computational Economics, vol. 60(4), pages 1353-1373, December.
    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. Nonthachote Chatsanga & Andrew J. Parkes, 2016. "International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints," Papers 1611.01463, arXiv.org.
    8. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    9. 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.
    10. Aliprantis, Charalambos D. & Polyrakis, Yiannis A. & Tourky, Rabee, 2002. "The cheapest hedge," Journal of Mathematical Economics, Elsevier, vol. 37(4), pages 269-295, July.
    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. 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.
    14. 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.
    15. 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.
    16. Aliprantis, Charalambos D. & Florenzano, Monique & Tourky, Rabee, 2006. "Production equilibria," Journal of Mathematical Economics, Elsevier, vol. 42(4-5), pages 406-421, August.
    17. Esteban Aguilera & Jins de Jong & Frank Phillipson & Skander Taamallah & Mischa Vos, 2024. "Multi-Objective Portfolio Optimization Using a Quantum Annealer," Mathematics, MDPI, vol. 12(9), pages 1-18, April.
    18. 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.
    19. 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.
    20. 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.

    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:eee:apmaco:v:385:y:2020:i:c:s0096300320304148. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.