2,115 research outputs found

    Ortalama-varyans portföy optimizasyonunda genetik algoritma uygulamaları üzerine bir literatür araştırması

    Get PDF
    Mean-variance portfolio optimization model, introduced by Markowitz, provides a fundamental answer to the problem of portfolio management. This model seeks an efficient frontier with the best trade-offs between two conflicting objectives of maximizing return and minimizing risk. The problem of determining an efficient frontier is known to be NP-hard. Due to the complexity of the problem, genetic algorithms have been widely employed by a growing number of researchers to solve this problem. In this study, a literature review of genetic algorithms implementations on mean-variance portfolio optimization is examined from the recent published literature. Main specifications of the problems studied and the specifications of suggested genetic algorithms have been summarized

    Portfolio selection using neural networks

    Full text link
    In this paper we apply a heuristic method based on artificial neural networks in order to trace out the efficient frontier associated to the portfolio selection problem. We consider a generalization of the standard Markowitz mean-variance model which includes cardinality and bounding constraints. These constraints ensure the investment in a given number of different assets and limit the amount of capital to be invested in each asset. We present some experimental results obtained with the neural network heuristic and we compare them to those obtained with three previous heuristic methods.Comment: 12 pages; submitted to "Computers & Operations Research

    Applying a global optimisation algorithm to Fund of Hedge Funds portfolio optimisation

    Get PDF
    Portfolio optimisation for a Fund of Hedge Funds (“FoHF”) has to address the asymmetric, non-Gaussian nature of the underlying returns distributions. Furthermore, the objective functions and constraints are not necessarily convex or even smooth. Therefore traditional portfolio optimisation methods such as mean-variance optimisation are not appropriate for such problems and global search optimisation algorithms could serve better to address such problems. Also, in implementing such an approach the goal is to incorporate information as to the future expected outcomes to determine the optimised portfolio rather than optimise a portfolio on historic performance. In this paper, we consider the suitability of global search optimisation algorithms applied to FoHF portfolios, and using one of these algorithms to construct an optimal portfolio of investable hedge fund indices given forecast views of the future and our confidence in such views.portfolio optimisation; optimization; fund of hedge funds; global search optimisation; direct search; pgsl; hedge fund portfolio

    Portfolio Optimisation Using the D-Wave Quantum Annealer

    Full text link
    The first quantum computers are expected to perform well at quadratic optimisation problems. In this paper a quadratic problem in finance is taken, the Portfolio Optimisation problem. Here, a set of assets is chosen for investment, such that the total risk is minimised, a minimum return is realised and a budget constraint is met. This problem is solved for several instances in two main indices, the Nikkei225 and the S\&P500 index, using the state-of-the-art implementation of D-Wave's quantum annealer and its hybrid solvers. The results are benchmarked against conventional, state-of-the-art, commercially available tooling. Results show that for problems of the size of the used instances, the D-Wave solution, in its current, still limited size, comes already close to the performance of commercial solvers.Comment: 14 pages, 1 figur

    Portfolio selection problems in practice: a comparison between linear and quadratic optimization models

    Full text link
    Several portfolio selection models take into account practical limitations on the number of assets to include and on their weights in the portfolio. We present here a study of the Limited Asset Markowitz (LAM), of the Limited Asset Mean Absolute Deviation (LAMAD) and of the Limited Asset Conditional Value-at-Risk (LACVaR) models, where the assets are limited with the introduction of quantity and cardinality constraints. We propose a completely new approach for solving the LAM model, based on reformulation as a Standard Quadratic Program and on some recent theoretical results. With this approach we obtain optimal solutions both for some well-known financial data sets used by several other authors, and for some unsolved large size portfolio problems. We also test our method on five new data sets involving real-world capital market indices from major stock markets. Our computational experience shows that, rather unexpectedly, it is easier to solve the quadratic LAM model with our algorithm, than to solve the linear LACVaR and LAMAD models with CPLEX, one of the best commercial codes for mixed integer linear programming (MILP) problems. Finally, on the new data sets we have also compared, using out-of-sample analysis, the performance of the portfolios obtained by the Limited Asset models with the performance provided by the unconstrained models and with that of the official capital market indices
    corecore