## Robust Portfolio Selection Problems (2001)

### Cached

### Download Links

- [firulete.ieor.columbia.edu]
- [www.corc.ieor.columbia.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Mathematics of Operations Research |

Citations: | 93 - 8 self |

### BibTeX

@ARTICLE{Goldfarb01robustportfolio,

author = {D. Goldfarb and G. Iyengar},

title = {Robust Portfolio Selection Problems},

journal = {Mathematics of Operations Research},

year = {2001},

volume = {28},

pages = {1--38}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 and, therefore, the computational effort required to solve them is comparable to that required for solving convex quadratic programs. Moreover, we show that these uncertainty structures correspond to confidence regions associated with the statistical procedures used to estimate the market parameters. We demonstrate a simple recipe for efficiently computing robust portfolios given raw market data and a desired level of confidence.