Robust Portfolio Selection Problems

@article{Goldfarb2003RobustPS,
  title={Robust Portfolio Selection Problems},
  author={Donald Goldfarb and Garud Iyengar},
  journal={Math. Oper. Res.},
  year={2003},
  volume={28},
  pages={1-38}
}
In this paper we show how to formulate and solve robust portfolio selection problems. The objective of these robust formulations is to systematically combat the sensitivity of the optimal portfolio to statistical and modeling errors in the estimates of the relevant market parameters. We introduce "uncertainty structures" for the market parameters and show that the robust portfolio selection problems corresponding to these uncertainty structures can be reformulated as second-order cone programs… 
View via Publisher
corc.ieor.columbia.edu
846 Citations
Highly Influential Citations
70
Background Citations
364
Methods Citations
186
Results Citations
14

846 Citations

Robust Portfolio Optimization

We show how to formulate and solve robust portfolio selection problems. The objective of these robust formulations is to systematically combat the sensitivity of the optimal portfolio to statistical…

Robust optimization and portfolio selection: The cost of robustness

Robust Optimisation and Portfolio Selection: The Cost of Robustness

Robust optimization is a tractable alternative to stochastic programming particularly suited for problems in which parameter values are unknown, variable, and their distributions are uncertain. We…

A practical guide to robust portfolio optimization

TLDR
The mechanisms by which robust optimization achieves its goal are investigated, practical guidance is given when it comes to the choice of uncertainty in form and level, and a diagonal uncertainty matrix with only variances should be used is used.

Robust portfolio selection under downside risk measures

TLDR
It is demonstrated that the problem formulations for robust portfolio selection based on the worst-case LPMs of degree 0, 1 and 2 under various structures of uncertainty can be cast as mathematically tractable optimization problems, such as linear programs, second-order cone programs or semidefinite programs.

An estimation-free, robust CVaR portfolio allocation model

We propose a novel optimization model to obtain robust solutions for portfolio allocation problems. Unlike related models in the literature, no historical data or statistical estimation techniques…

Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection

TLDR
Tight bounds on the expected values of several risk measures that are of interest to us are developed, and the robust optimization problem in that case can be solved by means of semidefinite programming (SDP), if no more than two additional chance inequalities are to be incorporated.

TR-2004-11 Robust Portfolio Management

TLDR
The computational results suggest that the robust active portfolio management strategy significantly outperforms the S&P 500 index without a significant increase in volatility.

Portfolio selection under distributional uncertainty: A relative robust CVaR approach

Improved Robust Portfolio Optimization

A robust optimization has emerged as a powerful tool for managing uncertainty in many optimization problems. This method was adapted in portfolio optimization to resolve the sensitivity issue of the…
...

References

SHOWING 1-10 OF 42 REFERENCES

Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach

TLDR
The problem of computing and optimizing the worst-case VaR and various other partial information on the distribution, including uncertainty in factor models, support constraints, and relative entropy information can be cast as semidefinite programs.

The effect of estimation risk on optimal portfolio choice

An Empirical Bayes Approach to Efficient Portfolio Selection

  • P. FrostJ. Savarino
  • Economics, Computer Science
    Journal of Financial and Quantitative Analysis
  • 1986
TLDR
This empirical Bayes method is shown to select portfolios whose performance is superior to that achieved, given the assumption of a noninformative prior or by using classical sample estimates.

Massaging mean-variance inputs: returns from alternative global investment strategies in the 1980s

This paper explores the impact of adjustments to the inputs on total returns, terminal wealth, and portfolio turnover in an unconstrained monthly mean-variance (MV) asset allocation over time. It is…

Computing efficient frontiers using estimated parameters

TLDR
The tradeoff between estimation error and stationarity is investigated and a method for adjusting for the bias is suggested and a statistical test is proposed to check for nonstationarity in historical data.

Credit risk optimization with Conditional Value-at-Risk criterion

TLDR
This paper examines a new approach for credit risk optimization based on the Conditional Value-at-Risk (CVaR) risk measure, the expected loss exceeding Value- at-Risks, also known as Mean Excess, Mean Shortfall, or Tail VaR.

Robust solutions of uncertain linear programs

Asset Allocation

nvestors create global bond portfolios for a variety of reasons: to diversify interest rate risk, to manage yield, to control exposure to foreign currencies, and to enlarge the universe of possible…

Beyond VaR: from measuring risk to managing risk

  • Helmut E. MausserD. Rosen
  • Economics
    Proceedings of the IEEE/IAFE 1999 Conference on Computational Intelligence for Financial Engineering (CIFEr) (IEEE Cat. No.99TH8408)
  • 1999
TLDR
This paper examines tools for managing, as opposed to simply monitoring, a portfolio's value-at-risk (VaR), and reviews the parametric, or delta-normal versions of these tools and then extends them to the simulation based, or nonparametric case.

Robust Convex Optimization

TLDR
If U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficientalgorithms such as polynomial time interior point methods.