Linear Programming

Diversification quotient based on expectiles ArXiv ID: 2411.14646 “View on arXiv” Authors: Unknown Abstract A diversification quotient (DQ) quantifies diversification in stochastic portfolio models based on a family of risk measures. We study DQ based on expectiles, offering a useful alternative to conventional risk measures such as Value-at-Risk (VaR) and Expected Shortfall (ES). The expectile-based DQ admits simple formulas and has a natural connection to the Omega ratio. Moreover, the expectile-based DQ is not affected by small-sample issues faced by VaR-based or ES-based DQ due to the scarcity of tail data. The expectile-based DQ exhibits pseudo-convexity in portfolio weights, allowing gradient descent algorithms for portfolio selection. We show that the corresponding optimization problem can be efficiently solved using linear programming techniques in real-data applications. Explicit formulas for DQ based on expectiles are also derived for elliptical and multivariate regularly varying distribution models. Our findings enhance the understanding of the DQ’s role in financial risk management and highlight its potential to improve portfolio construction strategies. ...

New approximate stochastic dominance approaches for Enhanced Indexation models ArXiv ID: 2401.12669 “View on arXiv” Authors: Unknown Abstract In this paper, we discuss portfolio selection strategies for Enhanced Indexation (EI), which are based on stochastic dominance relations. The goal is to select portfolios that stochastically dominate a given benchmark but that, at the same time, must generate some excess return with respect to a benchmark index. To achieve this goal, we propose a new methodology that selects portfolios using the ordered weighted average (OWA) operator, which generalizes previous approaches based on minimax selection rules and still leads to solving linear programming models. We also introduce a new type of approximate stochastic dominance rule and show that it implies the almost Second-order Stochastic Dominance (SSD) criterion proposed by Lizyayev and Ruszczynski (2012). We prove that our EI model based on OWA selects portfolios that dominate a given benchmark through this new form of stochastic dominance criterion. We test the performance of the obtained portfolios in an extensive empirical analysis based on real-world datasets. The computational results show that our proposed approach outperforms several SSD-based strategies widely used in the literature, as well as the global minimum variance portfolio. ...

Planning for the Efficient Updating of Mutual Fund Portfolios ArXiv ID: 2311.16204 “View on arXiv” Authors: Unknown Abstract Once there is a decision of rebalancing or updating a portfolio of funds, the process of changing the current portfolio to the target one, involves a set of transactions that are susceptible of being optimized. This is particularly relevant when managers have to handle the implications of different types of instruments. In this work we present linear programming and heuristic search approaches that produce plans for executing the update. The evaluation of our proposals shows cost improvements over the compared based strategy. The models can be easily extended to other realistic scenarios in which a holistic portfolio management is required ...

Efficient Solution of Portfolio Optimization Problems via Dimension Reduction and Sparsification ArXiv ID: 2306.12639 “View on arXiv” Authors: Unknown Abstract The Markowitz mean-variance portfolio optimization model aims to balance expected return and risk when investing. However, there is a significant limitation when solving large portfolio optimization problems efficiently: the large and dense covariance matrix. Since portfolio performance can be potentially improved by considering a wider range of investments, it is imperative to be able to solve large portfolio optimization problems efficiently, typically in microseconds. We propose dimension reduction and increased sparsity as remedies for the covariance matrix. The size reduction is based on predictions from machine learning techniques and the solution to a linear programming problem. We find that using the efficient frontier from the linear formulation is much better at predicting the assets on the Markowitz efficient frontier, compared to the predictions from neural networks. Reducing the covariance matrix based on these predictions decreases both runtime and total iterations. We also present a technique to sparsify the covariance matrix such that it preserves positive semi-definiteness, which improves runtime per iteration. The methods we discuss all achieved similar portfolio expected risk and return as we would obtain from a full dense covariance matrix but with improved optimizer performance. ...