University of St.Gallen
research platform alexandria
search publications
browse publications
by person
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
 
by year

Threshold Accepting Approach to Improve Bound-based Approximations for Portfolio Optimization

Daniel Kuhn, Panos Parpas & Berç Rustem

fulltext etc. no fulltext attached
A discretization scheme for a portfolio selection problem is discussed. The model is a benchmark relative, mean-variance optimization problem in continuous time. In order to make the model computationally tractable, it is discretized in time and space. This approximation scheme is designed in such a way that the optimal values of the approximate problems yield bounds on the optimal value of the original problem. The convergence of the bounds is discussed as the granularity of the discretization is increased. A threshold accepting algorithm that attempts to find the most accurate discretization among all discretizations of a given complexity is also proposed. Promising results of a numerical case study are provided.
   
type book chapter (English)
   
keywords portfolio optimization, stochastic programming, time discretization, bounds, threshold accepting
   
book title Computational Methods in Financial Engineering
date of appearance 2008
publisher Springer (Berlin, Heidelberg)
ISBN 978-3-540-77957-5
page(s) 3-26
citation Kuhn, D., Parpas, P., & Rustem, B. (2008). Threshold Accepting Approach to Improve Bound-based Approximations for Portfolio Optimization. In Computational Methods in Financial Engineering (pp. 3-26). Berlin, Heidelberg: Springer. - ISBN 978-3-540-77957-5.