6,207 research outputs found

    Asset Allocation under the Basel Accord Risk Measures

    Full text link
    Financial institutions are currently required to meet more stringent capital requirements than they were before the recent financial crisis; in particular, the capital requirement for a large bank's trading book under the Basel 2.5 Accord more than doubles that under the Basel II Accord. The significant increase in capital requirements renders it necessary for banks to take into account the constraint of capital requirement when they make asset allocation decisions. In this paper, we propose a new asset allocation model that incorporates the regulatory capital requirements under both the Basel 2.5 Accord, which is currently in effect, and the Basel III Accord, which was recently proposed and is currently under discussion. We propose an unified algorithm based on the alternating direction augmented Lagrangian method to solve the model; we also establish the first-order optimality of the limit points of the sequence generated by the algorithm under some mild conditions. The algorithm is simple and easy to implement; each step of the algorithm consists of solving convex quadratic programming or one-dimensional subproblems. Numerical experiments on simulated and real market data show that the algorithm compares favorably with other existing methods, especially in cases in which the model is non-convex

    A Heuristic Approach to Portfolio Optimization

    Get PDF
    Constraints on downside risk, measured by shortfall probability, expected shortfall, semi-variance etc., lead to optimal asset allocations which differ from the meanvariance optimum. The resulting optimization problem can become quite complex as it exhibits multiple local extrema and discontinuities, in particular if we also introduce constraints restricting the trading variables to integers, constraints on the holding size of assets or on the maximum number of different assets in the portfolio. In such situations classical optimization methods fail to work efficiently and heuristic optimization techniques can be the only way out. The paper shows how a particular optimization heuristic, called threshold accepting, can be successfully used to solve complex portfolio choice problems.Portfolio Optimization; Downside Risk Measures;Heuristic Optimization Threshold Accepting.

    Direct Data-Driven Portfolio Optimization with Guaranteed Shortfall Probability

    Get PDF
    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

    Minimizing value-at-risk in the single-machine total weighted tardiness problem

    Get PDF
    The vast majority of the machine scheduling literature focuses on deterministic problems, in which all data is known with certainty a priori. This may be a reasonable assumption when the variability in the problem parameters is low. However, as variability in the parameters increases incorporating this uncertainty explicitly into a scheduling model is essential to mitigate the resulting adverse effects. In this paper, we consider the celebrated single-machine total weighted tardiness (TWT) problem in the presence of uncertain problem parameters. We impose a probabilistic constraint on the random TWT and introduce a risk-averse stochastic programming model. In particular, the objective of the proposed model is to find a non-preemptive static job processing sequence that minimizes the value-at-risk (VaR) measure on the random TWT at a specified confidence level. Furthermore, we develop a lower bound on the optimal VaR that may also benefit alternate solution approaches in the future. In this study, we implement a tabu-search heuristic to obtain reasonably good feasible solutions and present results to demonstrate the effect of the risk parameter and the value of the proposed model with respect to a corresponding risk-neutral approach

    Market risk management in a post-Basel II regulatory environment

    Get PDF
    We propose a novel method of Mean-Capital Requirement portfolio optimization. The optimization is performed using a parallel framework for optimization based on the Nondominated Sorting Genetic Algorithm II. Capital requirements for market risk include an additional stress component introduced by the recent Basel 2.5 regulation. Our optimization with the Basel 2.5 formula in the objective function produces superior results to those of the old (Basel II) formula in stress scenarios in which the correlations of asset returns change considerably. These improvements are achieved at the expense of reduced cardinality of Pareto-optimal portfolios. This reduced cardinality (and thus portfolio diversification) in periods of relatively low market volatility may have unintended consequences for banks’ risk exposure
    corecore