Investment decisions and portfolios classificationbased on robust methods of estimation

In the process of assets selection and their allocation to the investment portfolio the most important factor issue thing is the accurate evaluation of the volatility of the return rate. In order to achieve stable and accurate estimates of parameters for contaminated multivariate normal distributions the robust estimators are required. In this paper we used some of the robust estimators to selection the optimal investment portfolios. The main goal of this paper was the comparative analysis of generated investment portfolios with respect to chosen robust estimation methods.Investment decisions, robust estimators, portfolios classification, cluster analysis 1. Introduction

Geometric Representation of the Mean-Variance-Skewness Portfolio Frontier Based upon the Shortage Function

The literature suggests that investors prefer portfolios based on mean, variance and skewness rather than portfolios based on mean-variance (MV) criteria solely. Furthermore, a small variety of methods have been proposed to determine mean-variance-skewness (MVS) optimal portfolios. Recently, the shortage function has been introduced as a measure of efficiency, allowing to characterize MVS optimalportfolios using non-parametric mathematical programming tools. While tracing the MV portfolio frontier has become trivial, the geometric representation of the MVS frontier is an open challenge. A hitherto unnoticed advantage of the shortage function is that it allows to geometrically represent the MVS portfolio frontier. The purpose of this contribution is to systematically develop geometric representations of the MVS portfolio frontier using the shortage function and related approaches.shortage function, efficient frontier, mean-variance-skewness efficiency

A bibliometric analysis and visualization of the scientific publications on multi-period portfolio optimization: From the current status to future directions

Portfolio optimization is a widely recognized strategy for investing that involves selecting a combination of assets that offers the optimal balance between potential gains and volatility. Traditional portfolio optimization typically focuses on a single period, considering only the current market conditions. However, multi-period portfolio optimization takes a more comprehensive approach by incorporating the dynamic nature of financial markets over multiple periods. Hence in this study, we focus on multi-period portfolio optimization. We conduct a bibliometric analysis of articles on multi-period portfolio optimization in the Web of Science (WoS) database. Through quantitative methods and the utilization of the Bibliometrix R package, we analyze publication trends, key research sites, and historical output in this field. Our findings provide valuable insights into the current state of research on multi-period portfolio optimization. This bibliometric analysis contributes to the existing literature on multi-period portfolio optimization and serves as a valuable resource for researchers, policymakers, and practitioners in the field of finance

A Semidefinite Programming approach for minimizing ordered weighted averages of rational functions

This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in general, neither rational functions nor the supremum of rational functions so that current results available for the minimization of rational functions cannot be applied to handle these problems. We prove that the problem can be transformed into a new problem embedded in a higher dimension space where it admits a convenient representation. This reformulation admits a hierarchy of SDP relaxations that approximates, up to any degree of accuracy, the optimal value of those problems. We apply this general framework to a broad family of continuous location problems showing that some difficult problems (convex and non-convex) that up to date could only be solved on the plane and with Euclidean distance, can be reasonably solved with different $\ell_p$-norms and in any finite dimension space. We illustrate this methodology with some extensive computational results on location problems in the plane and the 3-dimension space.Comment: 27 pages, 1 figure, 7 table

Twenty years of linear programming based portfolio optimization

a b s t r a c t Markowitz formulated the portfolio optimization problem through two criteria: the expected return and the risk, as a measure of the variability of the return. The classical Markowitz model uses the variance as the risk measure and is a quadratic programming problem. Many attempts have been made to linearize the portfolio optimization problem. Several different risk measures have been proposed which are computationally attractive as (for discrete random variables) they give rise to linear programming (LP) problems. About twenty years ago, the mean absolute deviation (MAD) model drew a lot of attention resulting in much research and speeding up development of other LP models. Further, the LP models based on the conditional value at risk (CVaR) have a great impact on new developments in portfolio optimization during the first decade of the 21st century. The LP solvability may become relevant for real-life decisions when portfolios have to meet side constraints and take into account transaction costs or when large size instances have to be solved. In this paper we review the variety of LP solvable portfolio optimization models presented in the literature, the real features that have been modeled and the solution approaches to the resulting models, in most of the cases mixed integer linear programming (MILP) models. We also discuss the impact of the inclusion of the real features