Abstract
Portfolio selection is about combining assets such that investors’ financial goals and needs are best satisfied. When operators and academics translate this actual problem into optimisation models, they face two restrictions: the models need to be empirically meaningful, and the models need to be soluble. This chapter will focus on the second restriction. Many optimisation models are difficult to solve because they have multiple local optima or are ‘badly-behaved’ in other ways. But on modern computers such models can still be handled, through so-called heuristics. To motivate the use of heuristic techniques in finance, we present examples from portfolio selection in which standard optimisation methods fail. We then outline the principles by which heuristics work. To make that discussion more concrete, we describe a simple but effective optimisation technique called Threshold Accepting and how it can be used for constructing portfolios. We also summarise the results of an empirical study on hedge-fund replication.
Thus computing is, or at least should be, intimately bound up with both the source of the problem and the use that is going to be made of the answers—it is not a step to be taken in isolation from reality. Richard W. Hamming, An Essay on Numerical Methods
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Such a merging of roles did not only happen in computational finance; it also took place in publishing and data analysis in general.
- 2.
In an empirically sound way, which essentially means careful data analysis and replication. See, for example, Cohen [7].
- 3.
Mathematically a function is nothing but a mapping, so there is no contradiction here. But when people see ϕ(x) they intuitively often think of something like \(\phi (x) = \sqrt{x} + x^{2}\) . We would prefer they thought of a programme, not a formula.
- 4.
In principle, because of such mechanisms a heuristic could drift farther and farther off a good solution. But practically, that is very unlikely because every heuristic has a bias towards good solutions. In Threshold Accepting, the method that we describe in Sect. 10.4, that bias comes into effect because a better solution is always accepted, a worse one only if it is not too bad. Since we repeat this creating of new candidate solutions thousands of times, we can be very certain that the scenario of drifting-off a good solution does practically not occur.
- 5.
- 6.
Similar techniques are used to obtain settings for Simulated Annealing; see for instance Johnson et al. [33].
- 7.
The example builds on Gilli et al. [26].
- 8.
In this case we computed 100 trajectories for each specification of the objective function.
- 9.
The median path is defined with respect to the final wealth of the portfolios generated with the jackknifing.
- 10.
Such an approach has been explored in Gilli and Këllezi [19] using artificial data.
References
D. Acker, N.W. Duck, Reference-day risk and the use of monthly returns data. J. Account. Audit. Financ. 22 (4), 527–557 (2007)
I. Althöfer, K.-U. Koschnick, On the convergence of “Threshold Accepting”. Appl. Math. Optim. 24 (1), 183–195 (1991)
J.S. Armstrong, Forecasting with econometric methods: Folklore versus fact. J. Bus. 51 (4), 549–564 (1978)
R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, W.R. Stewart, Designing and reporting on computational experiments with heuristic methods. J. Heuristics 1 (1), 9–32 (1995)
M.W. Brandt, Portfolio choice problems, in Handbook of Financial Econometrics, vol. 1, ed. by Y. Aït-Sahalia, L.P. Hansen (Elsevier, Amsterdam, 2009)
P. Burns, Random portfolios for performance measurement, in Optimisation, Econometric and Financial Analysis, ed. by E.J. Kontoghiorghes, C. Gatu (Springer, Berlin, 2010)
J. Cohen, The earth is round (p < . 05). Am. Psychol. 49 (12), 997–1003 (1994)
R.M. Dawes, The robust beauty of improper linear models in decision making. Am. Psychol. 34 (7), 571–582 (1979)
R.M. Dawes, House of Cards – Psychology and Psychotherapy Built on Myth (Free Press, New York, 1994)
R.S. Dembo, Scenario optimization. Ann. Oper. Res. 30 (1), 63–80 (1991)
G. Dueck, T. Scheuer, Threshold accepting. A general purpose optimization algorithm superior to simulated annealing. J. Comput. Phys. 90 (1), 161–175 (1990)
G. Dueck, P. Winker, New concepts and algorithms for portfolio choice. Appl. Stoch. Models Data Anal. 8 (3), 159–178 (1992)
E.J. Elton, M.J. Gruber, Estimating the dependence structure of share prices – Implications for portfolio selection. J. Financ. 28 (5), 1203–1232 (1973)
E.J. Elton, M.J. Gruber, T.J. Urich, Are betas best? J. Financ. 33 (5), 1375–1384 (1978)
P.A. Frost, J.E. Savarino, For better performance: constrain portfolio weights. J. Portf. Manag. 15 (1), 29–34 (1988)
S.B. Gelfand, S.K. Mitter, Analysis of simulated annealing for optimization. Technical Report LIDS-P-1494, MIT (1985)
G. Gigerenzer, Fast and frugal heuristics: the tools of bounded rationality, in Blackwell Handbook of Judgment and Decision Making, chap. 4, ed. by D.J. Koehler, N. Harvey (Blackwell Publishing, Oxford, 2004), pp. 62–88
G. Gigerenzer, Why heuristics work. Perspect. Psychol. Sci. 3 (1), 20–29 (2008)
M. Gilli, E. Këllezi, The threshold accepting heuristic for index tracking, in Financial Engineering, E-Commerce and Supply Chain, ed. by P. Pardalos, V.K. Tsitsiringos. Applied Optimization Series (Kluwer Academic Publishers, Boston, 2002), pp. 1–18
M. Gilli, E. Schumann, An empirical analysis of alternative portfolio selection criteria. Swiss Finance Institute Research Paper No. 09-06 (2009)
M. Gilli, E. Schumann, Optimization in financial engineering – an essay on ‘good’ solutions and misplaced exactitude. J. Financ. Transformation 28, 117–122 (2010)
M. Gilli, E. Schumann, Optimal enough? J. Heuristics 17 (4), 373–387 (2011). Available from http://dx.doi.org/10.1007/s10732-010-9138-y
M. Gilli, E. Schumann, Risk–reward optimisation for long-run investors: an empirical analysis. Eur. Actuar. J. 1 (1), 303–327, Supplement 2 (2011).
P.E. Gill, W. Murray, M.H. Wright, Practical Optimization (Elsevier, Amsterdam, 1986)
M. Gilli, E. Këllezi, H. Hysi, A data-driven optimization heuristic for downside risk minimization. J. Risk 8 (3), 1–18 (2006)
M. Gilli, E. Schumann, G. Cabej, J. Lula, Replicating hedge fund indices with optimization heuristics. Swiss Finance Institute Research Paper No. 10–22 (2010)
M. Gilli, D. Maringer, E. Schumann, Numerical Methods and Optimization in Finance (Academic, New York, 2011)
M. Gilli, E. Schumann, G. di Tollo, G. Cabej, Constructing 130/30-portfolios with the omega ratio. J. Asset Manag. 12 (2), 94–108 (2011). http://dx.doi.org/10.1057/jam.2010.25
D.G. Goldstein, G. Gigerenzer, Fast and frugal forecasting. Int. J. Forecast. 25 (4), 760–772 (2009)
H. Grootveld, W. Hallerbach, Variance vs downside risk: is there really that much difference? Eur. J. Oper. Res. 114 (2), 304–319 (1999)
W.J. Gutjahr, A graph-based Ant System and its convergence. Futur. Gener. Comput. Syst. 16 (9), 873–888 (2000)
R. Jagannathan, T. Ma, Risk reduction in large portfolios: why imposing the wrong constraints helps. J. Financ. 58 (4), 1651–1683 (2003)
D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper. Res. 37 (6), 865–892 (1989)
E. Jondeau, S.-H. Poon, M. Rockinger, Financial Modeling Under Non-Gaussian Distributions ( Springer, Berlin, 2007)
S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing. Science 220 (4598), 671–680 (1983)
B. LeBaron, A.S. Weigend, A bootstrap evaluation of the effect of data splitting on financial time series. IEEE Trans. Neural Netw. 9 (1), 213–220 (1998). Available from citeseer.ist.psu.edu/lebaron98bootstrap.html
A.D. Lovie, P. Lovie, The flat maximum effect and linear scoring models for prediction. J. Forecasting 5 (3), 159–168 (1986)
S. Makridakis, M. Hibon, The M3-competition: results, conclusions and implications. Int. J. Forecasting 16 (4), 451–476 (2000)
S. Makridakis, M. Hibon, C. Moser, Accuracy of forecasting: an empirical investigation. J. R. Stat. Soc. Ser. A (General) 142 (2), 97–145 (1979)
D. Maringer, Portfolio Management with Heuristic Optimization ( Springer, Berlin, 2005)
H.M. Markowitz, Portfolio selection. J. Financ. 7 (1), 77–91 (1952)
H.M. Markowitz, Portfolio Selection ( Wiley, New York, 1959)
O. Morgenstern, On the Accuracy of Economic Observations, 2nd edn. ( Princeton University Press, Princeton, 1963)
P. Moscato, J.F. Fontanari, Stochastic versus deterministic update in simulated annealing. Phys. Lett. A 146 (4), 204–208 (1990)
J. Pearl, Heuristics (Addison-Wesley, Reading, 1984)
G. Pólya, How to Solve it, 2nd edn. (Princeton University Press, Princeton, 1957)
M.J.D. Powell, Problems related to unconstrained optimization, in Numerical Methods for Unconstrained Optimization, ed. by W. Murray (Academic, New York, 1972)
G. Rudolph, Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Netw. 5 (1), 96–101 (1994)
E. Schumann, Take-the-best in portfolio selection. Available from http://enricoschumann.net (2013)
A. Scozzari, F. Tardella, S. Paterlini, T. Krink, Exact and heuristic approaches for the index tracking problem with UCITS constraints. Ann. Oper. Res. 205 (1), 235–250 (2013)
T. Stützle, M. Dorigo, A short convergence proof for a class of Ant Colony Optimization algorithms. IEEE Trans. Evol. Comput. 6 (4), 358–365 (2002)
L.N. Trefethen, Numerical analysis, in Princeton Companion to Mathematics, ed. by T. Gowers, J. Barrow-Green, I. Leader (Princeton University Press, Princeton, 2008)
A. Tversky, D. Kahneman, Judgment under uncertainty: heuristics and biases. Science 185 (4157), 1124–1131 (1974)
F. van den Bergh, A.P. Engelbrecht, A study of particle swarm optimization particle trajectories. Inf. Sci. 176 (8), 937–971 (2006)
J. von Neumann, H.H. Goldstine, Numerical inverting of matrices of high order. Bull. Am. Math. Soc. 53 (11), 1021–1099 (1947)
P. Winker, K.-T. Fang, Application of Threshold-Accepting to the evaluation of the discrepancy of a set of points. SIAM J. Numer. Anal. 34 (5), 2028–2042 (1997)
P. Winker, D. Maringer, The Threshold Accepting optimisation algorithm in economics and statistics, in Optimisation, Econometric and Financial Analysis, vol. 9, ed. by E.J. Kontoghiorghes, C. Gatu. Advances in Computational Management Science (Springer, Berlin, 2007), pp. 107–125
S.H. Zanakis, J.R. Evans, Heuristic “optimization”: Why, when, and how to use it. Interfaces 11 (5), 84–91 (1981)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gilli, M., Schumann, E. (2017). Heuristics for Portfolio Selection. In: Consigli, G., Kuhn, D., Brandimarte, P. (eds) Optimal Financial Decision Making under Uncertainty. International Series in Operations Research & Management Science, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-319-41613-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-41613-7_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41611-3
Online ISBN: 978-3-319-41613-7
eBook Packages: Business and ManagementBusiness and Management (R0)