IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v11y2017i4p380-390.html
   My bibliography  Save this article

Optimal computing budget allocation to the differential evolution algorithm for large-scale portfolio optimization

Author

Listed:
  • Wei-han Liu

Abstract

Differential evolution (DE) is one of the popular techniques in large-scale portfolio optimization, which is noticed for its applications in the problems that are non-convex, non-continuous, non-differentiable, and so on. This technique suffers specific short-comings, for example, unstable convergence in the final solution, trapped in local optimum, and demand for high number of replications. Optimal Computing Budget Allocation (OCBA) technique gives an efficient way to reach the global optimum by optimally assigning computing resource among designs. The integration of DE and OCBA gives better performance than DE alone in terms of convergence rate and the attained global optimum. The ordering of the integration also plays a vital role, that is, the strategy of first applying DE before OCBA outperforms the reversely ordered one. Both integration strategies are essentially the improved DE algorithms for large-scale portfolio optimization. In addition to numerical tests, empirical analysis of 100 stocks in S&P500 over a 10-year period confirms the conclusions.

Suggested Citation

  • Wei-han Liu, 2017. "Optimal computing budget allocation to the differential evolution algorithm for large-scale portfolio optimization," Journal of Simulation, Taylor & Francis Journals, vol. 11(4), pages 380-390, November.
    • Handle: RePEc:taf:tjsmxx:v:11:y:2017:i:4:p:380-390
    DOI: 10.1057/jos.2016.12
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2016.12
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jos.2016.12?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.

    Citations

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


    Cited by:

    1. Doering, Jana & Kizys, Renatas & Juan, Angel A. & Fitó, Àngels & Polat, Onur, 2019. "Metaheuristics for rich portfolio optimisation and risk management: Current state and future trends," Operations Research Perspectives, Elsevier, vol. 6(C).
    2. Kamesh Korangi & Christophe Mues & Cristi'an Bravo, 2024. "Large-scale Time-Varying Portfolio Optimisation using Graph Attention Networks," Papers 2407.15532, arXiv.org.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjsmxx:v:11:y:2017:i:4:p:380-390. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.