An open-source implementation of the critical-line algorithm for portfolio optimization (Q1736552)

From MaRDI portal
Revision as of 22:47, 18 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An open-source implementation of the critical-line algorithm for portfolio optimization
scientific article

    Statements

    An open-source implementation of the critical-line algorithm for portfolio optimization (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2019
    0 references
    Summary: Portfolio optimization is one of the problems most frequently encountered by financial practitioners. The main goal of this paper is to fill a gap in the literature by providing a well-documented, step-by-step open-source implementation of \textit{Critical Line Algorithm} (CLA) in scientific language. The code is implemented as a Python class object, which allows it to be imported like any other Python module, and integrated seamlessly with pre-existing code. We discuss the logic behind CLA following the algorithm's decision flow. In addition, we developed several utilities that support finding answers to recurrent practical problems. We believe this publication will offer a better alternative to financial practitioners, many of whom are currently relying on generic-purpose optimizers which often deliver suboptimal solutions. The source code discussed in this paper can be downloaded at the authors' websites (see Appendix).
    0 references
    portfolio selection
    0 references
    quadratic programming
    0 references
    portfolio optimization
    0 references
    constrained efficient frontier
    0 references
    turning point
    0 references
    Kuhn-Tucker conditions
    0 references
    risk aversion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references