125 research outputs found
Recommended from our members
Portfolio Optimization under Solvency Constraints: A Dynamical Approach
We develop portfolio optimization problems for a nonlife insurance company seeking to find the minimum capital required that simultaneously satisfies solvency and portfolio performance constraints. Motivated by standard insurance regulations, we consider solvency capital requirements based on three criteria: ruin probability, conditional Value-at-Risk, and expected policyholder deficit ratio. We propose a novel semiparametric formulation for each problem and explore the advantages of implementing this methodology over other potential approaches. When liabilities follow a Lognormal distribution, we provide sufficient conditions for convexity for each problem. Using different expected return on capital target levels, we construct efficient frontiers when portfolio assets are modeled with a special class of multivariate GARCH models. We find that the correlation between asset returns plays an important role in the behavior of the optimal capital required and the portfolio structure. The stability and out-of-sample performance of our optimal solutions are empirically tested with respect to both the solvency requirement and portfolio performance, through a double rolling window estimation exercise
Mean-risk models using two risk measures: A multi-objective approach
This paper proposes a model for portfolio optimisation, in which distributions are characterised and compared on the basis of three statistics: the expected value, the variance and the CVaR at a specified confidence level. The problem is multi-objective and transformed into a single objective problem in which variance is minimised while constraints are imposed on the expected value and CVaR. In the case of discrete random variables, the problem is a quadratic program. The mean-variance (mean-CVaR) efficient solutions that are not dominated with respect to CVaR (variance) are particular efficient solutions of the proposed model. In addition, the model has efficient solutions that are discarded by both mean-variance and mean-CVaR models, although they may improve the return distribution. The model is tested on real data drawn from the FTSE 100 index. An analysis of the return distribution of the chosen portfolios is presented
HMM based scenario generation for an investment optimisation problem
This is the post-print version of the article. The official published version can be accessed from the link below - Copyright @ 2012 Springer-Verlag.The Geometric Brownian motion (GBM) is a standard method for modelling financial time series. An important criticism of this method is that the parameters of the GBM are assumed to be constants; due to this fact, important features of the time series, like extreme behaviour or volatility clustering cannot be captured. We propose an approach by which the parameters of the GBM are able to switch between regimes, more precisely they are governed by a hidden Markov chain. Thus, we model the financial time series via a hidden Markov model (HMM) with a GBM in each state. Using this approach, we generate scenarios for a financial portfolio optimisation problem in which the portfolio CVaR is minimised. Numerical results are presented.This study was funded by NET ACE at OptiRisk Systems
Arbitrage and deflators in illiquid markets
This paper presents a stochastic model for discrete-time trading in financial
markets where trading costs are given by convex cost functions and portfolios
are constrained by convex sets. The model does not assume the existence of a
cash account/numeraire. In addition to classical frictionless markets and
markets with transaction costs or bid-ask spreads, our framework covers markets
with nonlinear illiquidity effects for large instantaneous trades. In the
presence of nonlinearities, the classical notion of arbitrage turns out to have
two equally meaningful generalizations, a marginal and a scalable one. We study
their relations to state price deflators by analyzing two auxiliary market
models describing the local and global behavior of the cost functions and
constraints
Processing second-order stochastic dominance models using cutting-plane representations
This is the post-print version of the Article. The official published version can be accessed from the links below. Copyright @ 2011 Springer-VerlagSecond-order stochastic dominance (SSD) is widely recognised as an important decision criterion in portfolio selection. Unfortunately, stochastic dominance models are known to be very demanding from a computational point of view. In this paper we consider two classes of models which use SSD as a choice criterion. The first, proposed by Dentcheva and Ruszczyński (J Bank Finance 30:433–451, 2006), uses a SSD constraint, which can be expressed as integrated chance constraints (ICCs). The second, proposed by Roman et al. (Math Program, Ser B 108:541–569, 2006) uses SSD through a multi-objective formulation with CVaR objectives. Cutting plane representations and algorithms were proposed by Klein Haneveld and Van der Vlerk (Comput Manage Sci 3:245–269, 2006) for ICCs, and by Künzi-Bay and Mayer (Comput Manage Sci 3:3–27, 2006) for CVaR minimization. These concepts are taken into consideration to propose representations and solution methods for the above class of SSD based models. We describe a cutting plane based solution algorithm and outline implementation details. A computational study is presented, which demonstrates the effectiveness and the scale-up properties of the solution algorithm, as applied to the SSD model of Roman et al. (Math Program, Ser B 108:541–569, 2006).This study was funded by OTKA, Hungarian
National Fund for Scientific Research, project 47340; by Mobile Innovation Centre, Budapest University of Technology, project 2.2; Optirisk Systems, Uxbridge, UK and by BRIEF (Brunel University Research Innovation and Enterprise Fund)
The Random Quadratic Assignment Problem
Optimal assignment of classes to classrooms \cite{dickey}, design of DNA
microarrays \cite{carvalho}, cross species gene analysis \cite{kolar}, creation
of hospital layouts cite{elshafei}, and assignment of components to locations
on circuit boards \cite{steinberg} are a few of the many problems which have
been formulated as a quadratic assignment problem (QAP). Originally formulated
in 1957, the QAP is one of the most difficult of all combinatorial optimization
problems. Here, we use statistical mechanical methods to study the asymptotic
behavior of problems in which the entries of at least one of the two matrices
that specify the problem are chosen from a random distribution .
Surprisingly, this case has not been studied before using statistical methods
despite the fact that the QAP was first proposed over 50 years ago
\cite{Koopmans}. We find simple forms for and , the
costs of the minimal and maximum solutions respectively. Notable features of
our results are the symmetry of the results for and
and the dependence on only through its mean and standard deviation,
independent of the details of . After the asymptotic cost is determined for
a given QAP problem, one can straightforwardly calculate the asymptotic cost of
a QAP problem specified with a different random distribution
OTIMIZAÇÃO DE PORTFÓLIOS: ANÁLISE DE EFICIÊNCIA
This article aims to analyze the behavior of a portfolio of assets selected by Data Envelopment Analysis (DEA), optimized by the Sharpe approach, and compare it to portfolios of assets obtained only by DEA or the Sharpe approach. To do that, we used the DEA model to assess the efficiency of shares of the São Paulo Stock Exchange (Bovespa), employing return, variance and other indicators such as input and output variables. Also, we used the Sharpe approach to optimize the portfolio composition. In the comparison of portfolios, we noted that the resulting combination of both models performed better than the portfolios optimized by only one of the models
Local search heuristics for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s also have a large number of applications. We consider several known neighborhoods, generalize them and propose some new ones. The heuristics are evaluated both theoretically and experimentally and dominating algorithms are selected. We also demonstrate that a combination of two neighborhoods may yield a heuristics which is superior to both of its components
- …