Distributionally robust optimization with applications to risk management

Many decision problems can be formulated as mathematical optimization models. While deterministic optimization problems include only known parameters, real-life decision problems almost invariably involve parameters that are subject to uncertainty. Failure to take this uncertainty under consideration may yield decisions which can lead to unexpected or even catastrophic results if certain scenarios are realized. While stochastic programming is a sound approach to decision making under uncertainty, it assumes that the decision maker has complete knowledge about the probability distribution that governs the uncertain parameters. This assumption is usually unjustified as, for most realistic problems, the probability distribution must be estimated from historical data and is therefore itself uncertain. Failure to take this distributional modeling risk into account can result in unduly optimistic risk assessment and suboptimal decisions. Furthermore, for most distributions, stochastic programs involving chance constraints cannot be solved using polynomial-time algorithms. In contrast to stochastic programming, distributionally robust optimization explicitly accounts for distributional uncertainty. In this framework, it is assumed that the decision maker has access to only partial distributional information, such as the first- and second-order moments as well as the support. Subsequently, the problem is solved under the worst-case distribution that complies with this partial information. This worst-case approach effectively immunizes the problem against distributional modeling risk. The objective of this thesis is to investigate how robust optimization techniques can be used for quantitative risk management. In particular, we study how the risk of large-scale derivative portfolios can be computed as well as minimized, while making minimal assumptions about the probability distribution of the underlying asset returns. Our interest in derivative portfolios stems from the fact that careless investment in derivatives can yield large losses or even bankruptcy. We show that by employing robust optimization techniques we are able to capture the substantial risks involved in derivative investments. Furthermore, we investigate how distributionally robust chance constrained programs can be reformulated or approximated as tractable optimization problems. Throughout the thesis, we aim to derive tractable models that are scalable to industrial-size problems

Robust Portfolio Optimization with Derivative Insurance Guarantees

Robust portfolio optimization aims to maximize the worst-case portfolio return given that the asset returns are allowed to vary within a prescribed uncertainty set. If the uncertainty set is not too large, the resulting portfolio performs well under normal market conditions. However, its performance may substantially degrade in the presence of market crashes, that is, if the asset returns materialize far outside of the uncertainty set. We propose a novel robust portfolio optimization model that provides additional strong performance guarantees for all possible realizations of the asset returns. This insurance is provided via optimally chosen derivatives on the assets in the portfolio. The resulting model constitutes a convex second- order cone program, which is amenable to efficient numerical solution. We evaluate the model using simulated and empirical backtests and conclude that it can out- perform standard robust portfolio optimization as well as classical mean-variance optimization.robust optimization, portfolio optimization, portfolio insurance, second order cone programming

Direito Administrativo e controle [4.ed.]

Divulgação dos SUMÁRIOS das obras recentemente incorporadas ao acervo da Biblioteca Ministro Oscar Saraiva do STJ. Em respeito à lei de Direitos Autorais, não disponibilizamos a obra na íntegra.Localização na estante: 35.077.2(81) Z99

Worst-Case Value-at-Risk of Non-Linear Portfolios

Portfolio optimization problems involving Value-at-Risk (VaR) are often computationally intractable and require complete information about the return distribution of the portfolio constituents, which is rarely available in practice. These difficulties are further compounded when the portfolio contains derivatives. We develop two tractable conservative approximations for the VaR of a derivative portfolio by evaluating the worst-case VaR over all return distributions of the derivative underliers with given first- and second-order moments. The derivative returns are modelled as convex piecewise linear or - by using a delta-gamma approximation - as (possibly non-convex) quadratic functions of the returns of the derivative underliers. These models lead to new Worst-Case Polyhedral VaR (WCPVaR) and Worst-Case Quadratic VaR (WCQVaR) approximations, respectively. WCPVaR is a suitable VaR approximation for portfolios containing long positions in European options expiring at the end of the investment horizon, whereas WCQVaR is suitable for portfolios containing long and/or short positions in European and/or exotic options expiring beyond the investment horizon. We prove that WCPVaR and WCQVaR optimization can be formulated as tractable second-order cone and semidefinite programs, respectively, and reveal interesting connections to robust portfolio optimization. Numerical experiments demonstrate the benefits of incorporating non-linear relationships between the asset returns into a worst-case VaR model.Value-at-Risk, Derivatives, Robust Optimization, Second-Order Cone Programming, Semidefinite Programming

Robust Optimization of Currency Portfolios

We study a currency investment strategy, where we maximize the return on a portfolio of foreign currencies relative to any appreciation of the corresponding foreign exchange rates. Given the uncertainty in the estimation of the future currency values, we employ robust optimization techniques to maximize the return on the portfolio for the worst-case foreign exchange rate scenario. Currency portfolios differ from stock only portfolios in that a triangular relationship exists among foreign exchange rates to avoid arbitrage. Although the inclusion of such a constraint in the model would lead to a nonconvex problem, we show that by choosing appropriate uncertainty sets for the exchange and the cross exchange rates, we obtain a convex model that can be solved efficiently. Alongside robust optimization, an additional guarantee is explored by investing in currency options to cover the eventuality that foreign exchange rates materialize outside the specified uncertainty sets. We present numerical results that show the relationship between the size of the uncertainty sets and the distribution of the investment among currencies and options, and the overall performance of the model in a series of backtesting experiments.robust optimization, portfolio optimization, currency hedging, second-order cone programming

Análise de métodos diretos e iterativos para resolução de problemas de fluxo de carga

Monografia (graduação)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2014.Os estudos dos sistemas elétricos de potência envolvem problemas de fluxo de carga. Esses tipos de problema resultam em equações não-lineares e exigem a resolução sistemas lineares esparsos de grande porte como parte de processos iterativos. Nesse trabalho, foram realizados estudos de diferentes formulações matemáticas para a resolução do problema de fluxo de carga pelo método de Newton-Raphson, utilizando coordenadas polares, coordenadas retangulares e modelagem por injeção de corrente. Métodos diretos e iterativos foram apresentados e estudados em aplicações de sistemas lineares esparsos de grande porte para verificar o desempenho computacional. Foram realizados estudos de sensibilidade aos parâmetros dos métodos utilizados. Um novo método direto para resolução de sistemas lineares baseado na expansão linear da série de Taylor foi apresentado e testado. As simulações foram realizadas no MATPOWER utilizando principalmente o sistema elétricos de 3375 barras.Electric power system studies involve power flow problem solutions. This type of problem requires the calculation of large and sparse linear systems as part of a nonlinear iterative process. This report presents different strategies to solve linear systems applied to the power flow problem. The system mathematical representation takes into account bus voltages in the form of polar and rectangular coordinates, as well as current injection model. Direct and iterative methods for solving large and sparse linear systems are presented and studied. The performance of each method is evaluated for several numerical experiments, including sensitivity of parameters. A new direct method for solving linear systems based on the linear expansion of Taylor’s series was presented and tested. The simulations were performed in the software MATPOWER, by using mainly a 3375-bus system

Direct Data-Driven Portfolio Optimization with Guaranteed Shortfall Probability

This paper proposes a novel methodology for optimal allocation of a portfolio of risky financial assets. Most existing methods that aim at compromising between portfolio performance (e.g., expected return) and its risk (e.g., volatility or shortfall probability) need some statistical model of the asset returns. This means that: ({\em i}) one needs to make rather strong assumptions on the market for eliciting a return distribution, and ({\em ii}) the parameters of this distribution need be somehow estimated, which is quite a critical aspect, since optimal portfolios will then depend on the way parameters are estimated. Here we propose instead a direct, data-driven, route to portfolio optimization that avoids both of the mentioned issues: the optimal portfolios are computed directly from historical data, by solving a sequence of convex optimization problems (typically, linear programs). Much more importantly, the resulting portfolios are theoretically backed by a guarantee that their expected shortfall is no larger than an a-priori assigned level. This result is here obtained assuming efficiency of the market, under no hypotheses on the shape of the joint distribution of the asset returns, which can remain unknown and need not be estimate

Robust and Pareto Optimality of Insurance Contract

The optimal insurance problem represents a fast growing topic that explains the most efficient contract that an insurance player may get. The classical problem investigates the ideal contract under the assumption that the underlying risk distribution is known, i.e. by ignoring the parameter and model risks. Taking these sources of risk into account, the decision-maker aims to identify a robust optimal contract that is not sensitive to the chosen risk distribution. We focus on Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR)-based decisions, but further extensions for other risk measures are easily possible. The Worst-case scenario and Worst-case regret robust models are discussed in this paper, which have been already used in robust optimisation literature related to the investment portfolio problem. Closed-form solutions are obtained for the VaR Worst-case scenario case, while Linear Programming (LP) formulations are provided for all other cases. A caveat of robust optimisation is that the optimal solution may not be unique, and therefore, it may not be economically acceptable, i.e. Pareto optimal. This issue is numerically addressed and simple numerical methods are found for constructing insurance contracts that are Pareto and robust optimal. Our numerical illustrations show weak evidence in favour of our robust solutions for VaR-decisions, while our robust methods are clearly preferred for CVaR-based decisions