Active extension portfolio optimization with non-convex risk measures using metaheuristics
Abstract
We consider the optimization of active extension portfolios. For this purpose, the optimization problem is rewritten as a stochastic programming model and solved using a clever multi-start local search heuristic, which turns out to provide stable solutions. The heuristic solutions are compared to optimization results of convex optimization solvers where applicable. Furthermore, the approach is applied to solve problems with non-convex risk measures, most notably to minimize Value-at-Risk. Numerical results using data from both the Dow Jones Industrial Average as well as the DAX 30 are shown.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.