On the simulation of portfolios of interest rate and credit risk sensitive securities

We discuss extensions of reduced-form and structural models for pricing credit risky securities to portfolio simulation and valuation. Stochasticity in interest rates and credit spreads is captured via reduced-form models and is incorporated with a default and migration model based on the structural credit risk modelling approach. Calculated prices are consistent with observed prices and the term structure of default-free and defaultable interest rates. Three applications are discussed: (i) study of the inter-temporal price sensitivity of credit bonds and the sensitivity of future portfolio valuation with respect to changes in interest rates, default probabilities, recovery rates and rating migration, (ii) study of the structure of credit risk by investigating the impact of disparate risk factors on portfolio risk, and (iii) tracking of corporate bond indices via simulation and optimisation models. In particular, we study the effect of uncertainty in credit spreads and interest rates on the overall risk of a credit portfolio, a topic that has been recently discussed by Kiesel et al. [The structure of credit risk: spread volatility and ratings transitions. Technical report, Bank of England, ISSN 1268-5562, 2001], but has been otherwise mostly neglected. We find that spread risk and interest rate risk are important factors that do not diversify away in a large portfolio context, especially when high-quality instruments are considered.     

Tail behaviour of credit loss distributions for general latent factor models

Using a limiting approach to portfolio credit risk, we obtain analytic expressions for the tail behavior of credit losses. To capture the co‐movements in defaults over time, we assume that defaults are triggered by a general, possibly non‐linear, factor model involving both systematic and idiosyncratic risk factors. The model encompasses default mechanisms in popular models of portfolio credit risk, such as CreditMetrics and CreditRisk⁺. We show how the tail characteristics of portfolio credit losses depend directly upon the factor model's functional form and the tail properties of the model's risk factors. In many cases the credit loss distribution has a polynomial (rather than exponential) tail. This feature is robust to changes in tail characteristics of the underlying risk factors. Finally, we show that the interaction between portfolio quality and credit loss tail behavior is strikingly different between the CreditMetrics and CreditRisk⁺ approach to modeling portfolio credit risk.     

Portfolio optimization via stochastic programming: Methods of output analysis

Solutions of portfolio optimization problems are often influenced by errors or misspecifications due to approximation, estimation and incomplete information. Selected methods for analysis of results obtained by solving stochastic programs are presented and their scope illustrated on generic examples – the Markowitz model, a multiperiod bond portfolio management problem and a general strategic investment problem. The approaches are based on asymptotic and robust statistics, on the moment problem and on results of parametric optimization.     

Small Sample Asymptotics for Credit Risk Portfolios

This article considers small sample asymptotics for the distribution of the total loss S_n of a credit risk portfolio. For portfolios with a few exceptionally high potential loss values, the distribution of S_n turns out to be bimodal. Direct approximation by Esscher tilting does not capture this feature. An improved recursive algorithm is proposed. The new approach leads to a more accurate small sample approximation that models bimodality in the presence of outliers. The results are illustrated by a simulated example as well as an example of an observed credit risk portfolio.     

Minimal concave cost rebalance of a portfolio to the efficient frontier

One usually constructs a portfolio on the efficient frontier, but it may not be efficient after, say three months since the efficient frontier will shift as the elapse of time. We then have to rebalance the portfolio if the deviation is no longer acceptable. The method to be proposed in this paper is to find a portfolio on the new efficient frontier such that the total transaction cost required for this rebalancing is minimal. This problem results in a nonconvex minimization problem, if we use mean-variance model. In this paper we will formulate this problem by using absolute deviation as the measure of risk and solve the resulting linearly constrained concave minimization problem by a branch and bound algorithm successfully applied to portfolio optimization problem under concave transaction costs. It will be demonstrated that this method is efficient and that it leads to a significant reduction of transaction costs. Key words.portfolio optimization – rebalance – mean-absolute deviation model – concave cost minimization – optimization over the efficient set – global optimizationMathematics Subject Classification (1991):20E28, 20G40, 20C20     

A closed-form solution of the Black–Litterman model with conditional value at risk

We consider a portfolio optimization problem of the Black–Litterman type, in which we use the conditional value-at-risk (CVaR) as the risk measure and we use the multi-variate elliptical distributions, instead of the multi-variate normal distribution, to model the financial asset returns. We propose an approximation algorithm and establish the convergence results. Based on the approximation algorithm, we derive a closed-form solution of the portfolio optimization problems of the Black–Litterman type with CVaR.     

A review of credibilistic portfolio selection

This paper reviews the credibilistic portfolio selection approaches which deal with fuzzy portfolio selection problem based on credibility measure. The reason for choosing credibility measure is given. Several mathematical definitions of risk of an investment in the portfolio are introduced. Some credibilistic portfolio selection models are presented, including mean-risk model, mean-variance model, mean-semivariance model, credibility maximization model, α-return maximization model, entropy optimization model and game models. A hybrid intelligent algorithm for solving the optimization models is documented. In addition, as extensions of credibilistic portfolio selection approaches, the paper also gives a brief review of some hybrid portfolio selection models.     

Data-Recursive Smoother Formulae for Partially Observed Discrete-Time Markov Chains

Abstract

We address a dynamic portfolio optimization problem where the expected utility from terminal wealth has to be maximized. The special feature of this paper is an additional constraint on the portfolio strategy modeling bounded shortfall risks, which are measured by value at risk or expected loss. Using a continuous-time model of a complete financial market and applying martingale methods, analytic expressions for the optimal terminal wealth and the optimal portfolio strategies are given. Finally, some numerical results are presented.     

Portfolio insurance under a risk-measure constraint

We study the problem of portfolio insurance from the point of view of a fund manager, who guarantees to the investor that the portfolio value at maturity will be above a fixed threshold. If, at maturity, the portfolio value is below the guaranteed level, a third party will refund the investor up to the guarantee. In exchange for this protection, the third party imposes a limit on the risk exposure of the fund manager, in the form of a convex monetary risk measure. The fund manager therefore tries to maximize the investor’s utility function subject to the risk-measure constraint. We give a full solution to this non-convex optimization problem in the complete market setting and show in particular that the choice of the risk measure is crucial for the optimal portfolio to exist. Explicit results are provided for the entropic risk measure (for which the optimal portfolio always exists) and for the class of spectral risk measures (for which the optimal portfolio may fail to exist in some cases).     

Stochastic differential portfolio games for an insurer in a jump-diffusion risk process

We discuss an optimal portfolio selection problem of an insurer who faces model uncertainty in a jump-diffusion risk model using a game theoretic approach. In particular, the optimal portfolio selection problem is formulated as a two-person, zero-sum, stochastic differential game between the insurer and the market. There are two leader-follower games embedded in the game problem: (i) The insurer is the leader of the game and aims to select an optimal portfolio strategy by maximizing the expected utility of the terminal surplus in the “worst-case” scenario; (ii) The market acts as the leader of the game and aims to choose an optimal probability scenario to minimize the maximal expected utility of the terminal surplus. Using techniques of stochastic linear-quadratic control, we obtain closed-form solutions to the game problems in both the jump-diffusion risk process and its diffusion approximation for the case of an exponential utility.     

基于双因子CIR强度式定价的信用债券投资组合优化

信用风险和利率风险是相互关联影响的。资产组合优化不能将这两种风险单独考虑或简单的相加,应该进行整体的风险控制,不然会造成投资风险的低估。本文的主要工作:一是在强度式定价模型的框架下,分别利用CIR随机利率模型刻画利率风险因素“无风险利率”和信用风险因素“违约强度”的随机动态变化,衡量在两类风险共同影响下信用债券的市场价值,从而构建CRRA型投资效用函数。以CRRA型投资效用函数最大化作为目标函数,同时控制利率和信用两类风险。弥补了现有研究中仅单独考虑信用风险或利率风险、无法对两种风险进行整体控制的弊端。二是将无风险利率作为影响违约强度的一个因子,利用“无风险利率因子”和“纯信用因子”的双因子CIR模型拟合违约强度,考虑了市场利率变化对于债券违约强度的影响,反映两种风险的相关性。使得投资组合模型中既同时考虑了信用风险和利率风险、又考虑了两种风险的交互影响。避免在优化资产组合时忽略两种风险间相关性、可能造成风险低估的问题。     

Machine Learning Approximation Algorithms for High-Dimensional Fully Nonlinear Partial Differential Equations and Second-order Backward Stochastic Differential Equations

High-dimensional partial differential equations (PDEs) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number of financial assets in a portfolio. Moreover, such PDEs are often fully nonlinear due to the need to incorporate certain nonlinear phenomena in the model such as default risks, transaction costs, volatility uncertainty (Knightian uncertainty), or trading constraints in the model. Such high-dimensional fully nonlinear PDEs are exceedingly difficult to solve as the computational effort for standard approximation methods grows exponentially with the dimension. In this work, we propose a new method for solving high-dimensional fully nonlinear second-order PDEs. Our method can in particular be used to sample from high-dimensional nonlinear expectations. The method is based on (1) a connection between fully nonlinear second-order PDEs and second-order backward stochastic differential equations (2BSDEs), (2) a merged formulation of the PDE and the 2BSDE problem, (3) a temporal forward discretization of the 2BSDE and a spatial approximation via deep neural nets, and (4) a stochastic gradient descent-type optimization procedure. Numerical results obtained using TensorFlow in Python illustrate the efficiency and the accuracy of the method in the cases of a 100-dimensional Black–Scholes–Barenblatt equation, a 100-dimensional Hamilton–Jacobi–Bellman equation, and a nonlinear expectation of a 100-dimensional G-Brownian motion.

     

信用资产组合优化的"条件在险值-补偿"型随机规划模型

本文对于信用资产组合的优化问题给出了一个稳健的模型，所建模型涉及了条件在险值（CVaR）风险度量以及具有补偿限制的随机线性规划框架，其思想是在CVaR与信用资产组合的重构费用之间进行权衡，并降低解对于随机参数的实现的敏感性．为求解相应的非线性规划，本文将基本模型转化为一系列的线性规划的求解问题．     

鲁棒信用风险优化的线性锥优化模型

考虑了具有强健性的信用风险优化问题. 根据最差条件在值风险度量信用风险的方法,建立了信用风险优化问题的模型. 由于信用风险的损失分布存在不确定性,考虑了两类不确定性区间,即箱子型区间和椭球型区间. 把具有强健性的信用风险优化问题分别转化成线性规划问题和二阶锥规划问题. 最后,通过一个信用风险问题的例子来说明此模型的有效性.     

Heterogeneous credit portfolios and the dynamics of the aggregate losses

We study the impact of contagion in a network of firms facing credit risk. We describe an intensity based model where the homogeneity assumption is broken by introducing a random environment that makes it possible to take into account the idiosyncratic characteristics of the firms. We shall see that our model goes behind the identification of groups of firms that can be considered basically exchangeable. Despite this heterogeneity assumption our model has the advantage of being totally tractable. The aim is to quantify the losses that a bank may suffer in a large credit portfolio. Relying on a large deviation principle on the trajectory space of the process, we state a suitable law of large numbers and a central limit theorem useful for studying large portfolio losses. Simulation results are provided as well as applications to portfolio loss distribution analysis.     

On the parameterization of the CreditRisk model for estimating credit portfolio risk

The CreditRisk⁺ model is one of the industry standards for estimating the credit default risk for a portfolio of credit loans. The natural parameterization of this model requires the default probability to be apportioned using a number of (non-negative) factor loadings. However, in practice only default correlations are often available but not the factor loadings. In this paper we investigate how to deduce the factor loadings from a given set of default correlations. This is a novel approach and it requires the non-negative factorization of a positive semi-definite matrix which is by no means trivial. We also present a numerical optimization algorithm to achieve this.     

Twenty years of linear programming based portfolio optimization

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.     

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are non-convex, the problems under consideration are all NP-hard in general. In this paper we shall focus on polynomial-time approximation algorithms. In particular, we first study optimization of a multi-linear tensor function over the Cartesian product of spheres. We shall propose approximation algorithms for such problem and derive worst-case performance ratios, which are shown to be dependent only on the dimensions of the model. The methods are then extended to optimize a generic multi-variate homogeneous polynomial function with spherical constraint. Likewise, approximation algorithms are proposed with provable approximation performance ratios. Furthermore, the constraint set is relaxed to be an intersection of co-centered ellipsoids; namely, we consider maximization of a homogeneous polynomial over the intersection of ellipsoids centered at the origin, and propose polynomial-time approximation algorithms with provable worst-case performance ratios. Numerical results are reported, illustrating the effectiveness of the approximation algorithms studied.