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

Daniel Kuhn (), Panos Parpas () and Berç Rustem ()
Additional contact information
Daniel Kuhn: Imperial College London
Panos Parpas: Imperial College London
Berç Rustem: Imperial College London

A chapter in Computational Methods in Financial Engineering, 2008, pp 3-26 from Springer

Abstract: Abstract 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.

Keywords: Portfolio optimization; stochastic programming; time discretization; bounds; threshold accepting (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-77958-2_1

Ordering information: This item can be ordered from
http://www.springer.com/9783540779582

DOI: 10.1007/978-3-540-77958-2_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().