|
|
2005. Alpha-Bet Soup – Combining Stock and Sector Alphas in Portfolio Construction. Morgan Stanley.
Abstract: The current market environment of low volatility and dispersion, coupled with high correlation across stocks and asset classes, has led many investors to place greater emphasis on disciplined alpha generation and portfolio construction. The focus has increasingly been on identifying high-conviction alpha opportunities, and on maximizing the return potential from these opportunities. The portfolio construction process must be designed such that these disparate alphas are consistently represented in the portfolio. This means active weights should be determined independently for each alpha source, before they are combined into a final portfolio. To this end, we propose a multi-stage portfolio construction process and illustrate the process by combining our quantitative sector and stock selection models.
Keywords: PortfolioConstruction
|
|
|
|
Almgren, R. & Chriss, N., 2004. Optimal Portfolios from Ordering Information.
Abstract: Modern portfolio theory produces an optimal portfolio from estimates of expected returns and a covariance matrix. We present a method for portfolio optimization based on replacing expected returns with sorting criteria, that is, with information about the order of the expected returns but not their values. We give a simple and economically rational definition of optimal portfolios that extends Markowitz’ definition in a natural way; in particular, our construction allows full use of covariance information. We give efficient numerical algorithms for constructing optimal portfolios. This formulation is very general and is easily extended to more general cases: where assets are divided into multiple sectors or there are multiple sorting criteria available, and may be combined with transaction cost restrictions. Using both real and simulated data, we demonstrate dramatic improvement over simpler strategies.
Keywords: PortfolioConstruction
|
|
|
|
Almgren, R. & Chriss, N., 2005. Portfolios from Sorts.
Abstract: Modern portfolio theory produces an optimal portfolio from estimates of expected returns and a covariance matrix. We present a method for portfolio optimization based on replacing expected returns with ordering information, that is, with information about the order of the expected returns. We give a simple and economically rational definition of optimal portfolios that extends Markowitz’ meanvariance optimality condition in a natural way; in particular, our construction allows full use of covariance information. We also provide efficient numerical algorithms. The formulation we develop is very general and is easily extended to a variety of cases, for example, where assets are divided into multiple sectors or there are multiple sorting criteria available.
Keywords: PortfolioConstruction
|
|
|
|
Birge, J.R. ed.. Optimal Dynamic Portfolio Management with Stochastic Programming.
Keywords: PortfolioConstruction
|
|
|
|
Borodin, A., El-Yaniv, R. & Gogan, V.. Can We Learn to Beat the Best Stock.
Abstract: A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide strong evidence that this type of technical trading can “beat the market” and moreover, can beat the best stock in the market. In doing so we utilize a new idea for smoothing critical parameters in the context of expert learning.
Keywords: PortfolioConstruction; UniversalPortfolios
|
|
|
|
Brodie, J. et al, 2008. Sparse and Stable Markowitz Portfolios. Frankfurt, Germany: European Central Bank.
Abstract: We consider the problem of portfolio selection within the classical Markowitz meanvariance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (stabilizes) the optimization problem, encourages sparse portfolios (i.e. portfolios with only few active positions), and allows to account for transaction costs. Our approach recovers as special cases the noshort- positions portfolios, but does allow for short positions in limited number. We implement this methodology on two benchmark data sets constructed by Fama and French. Using only a modest amount of training data, we construct portfolios whose out-of-sample performance, as measured by Sharpe ratio, is consistently and significantly better than that of the naive evenly-weighted portfolio which constitutes, as shown in recent literature, a very tough benchmark.
Keywords: PortfolioConstruction
|
|
|
|
Chen, S.-ping, Li, C., Li, S.-hong & Wu, X.-wei, 2002. Portfolio Optimization with Transaction Costs, Acta Mathematicae Applicatae Sinica, English Series, 18 (2), p. 231–248.
Abstract: The purpose of the article is to formulate, under the l∞ risk measure, a model of portfolio selection with transaction costs and then investigate the optimal strategy within the proposed. The characterization of a optimal strategy and the efficient algorithm for finding the optimal strategy are given.
Keywords: PortfolioConstruction
|
|
|
|
Cheng, S., Liu, Y. & Wang, S., 2004. Progress in Risk Measurement, Advanced Modelling and Optimization, 6 (1).
Abstract: In this paper, we give the axiomatic characterization of risk measures and discuss the treads of developments in this area. The main recently proposed risk measures are presented, and their properties and relations are discussed. The corresponding versions of dynamic risk measure are also briefly introduced.
Keywords: PortfolioConstruction
|
|