Clustering and portfolio selection problems: a unified framework
From MaRDI portal
Publication:2297578
Abstract: Given a set of assets and an investment capital, the classical portfolio selection problem consists in determining the amount of capital to be invested in each asset in order to build the most profitable portfolio. The portfolio optimization problem is naturally modeled as a mean-risk bi-criteria optimization problem where the mean rate of return of the portfolio must be maximized whereas a given risk measure must be minimized. Several mathematical programming models and techniques have been presented in the literature in order to efficiently solve the portfolio problem. A relatively recent promising line of research is to exploit clustering information of an assets network in order to develop new portfolio optimization paradigms. In this paper we endow the assets network with a metric based on correlation coefficients between assets' returns, and show how classical location problems on networks can be used for clustering assets. In particular, by adding a new criterion to the portfolio selection problem based on an objective function of a classical location problem, we are able to measure the effect of clustering on the selected assets with respect to the non-selected ones. Most papers dealing with clustering and portfolio selection models solve these problems in two distinct steps: cluster first and then selection. The innovative contribution of this paper is that we propose a Mixed-Integer Linear Programming formulation for dealing with this problem in a unified phase. The effectiveness of our approach is validated reporting some preliminary computational experiments on some real financial dataset.
Recommendations
- Cluster analysis for portfolio optimization
- Efficient cluster-based portfolio optimization
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method
- The optimal portfolio with a modified covariance matrix using the clustering method
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- A clustering approach for scenario tree reduction: an application to a stochastic programming portfolio optimization problem
- A discussion of scalarization techniques for multiple objective integer programming
- A mixed integer linear model for clustering with variable selection
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- A new method for mean-variance portfolio optimization with cardinality constraints
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Categorical data fuzzy clustering: an analysis of local search heuristics
- Cluster analysis for portfolio optimization
- Coherent measures of risk
- Collective dynamics of `small-world' networks
- Conditional value at risk and related linear programming models for portfolio optimization
- Equal risk bounding is better than risk parity for portfolio selection
- Estimation for Markowitz Efficient Portfolios
- Heuristics for cardinality constrained portfolio optimization
- Introduction to Econophysics
- Linear and mixed integer programming for portfolio optimization
- Linear vs. quadratic portfolio selection models with hard real-world constraints
- Multicriteria Optimization
- On exact and approximate stochastic dominance strategies for portfolio selection
- Solving large \(p\)-median problems with a radius formulation
Cited in
(11)- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method
- Portfolio optimization through a network approach: network assortative mixing and portfolio diversification
- A clustering‐based review on project portfolio optimization methods
- A clustering approach for scenario tree reduction: an application to a stochastic programming portfolio optimization problem
- A combinatorial optimization approach to scenario filtering in portfolio selection
- A clustering-based portfolio strategy incorporating momentum effect and market trend prediction
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- Cluster analysis for portfolio optimization
- A tail-revisited Markowitz mean-variance approach and a portfolio network centrality
- A matheuristic for large-scale capacitated clustering
This page was built for publication: Clustering and portfolio selection problems: a unified framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297578)
