Linear programing models for portfolio optimization using a benchmark
Year of publication: |
2019
|
---|---|
Authors: | Park, Seyoung ; Song, Hyunson ; Lee, Sungchul |
Subject: | Dantzig | linear programing | Mean-absolute deviation risk | perturbation | portfolio optimization | sparsity | Portfolio-Management | Portfolio selection | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Benchmarking |
-
High-dimensional sparse index tracking based on a multi-step convex optimization approach
Shi, Fangquan, (2023)
-
Genetic algorithm versus classical methods in sparse index tracking
Giuzio, Margherita, (2017)
-
A linear-programming portfolio optimizer to mean-variance optimization
Liu, Xiaoyue, (2023)
- More ...
-
Big Data Analysis with Hadoop on Personalized Incentive Model with Statistical Hotel Customer Data
Lee, Sungchul, (2016)
-
On pricing options with stressed-beta in a reduced form model
Kim, Geonwoo, (2015)
-
Rate of convergence of power-weighted Euclidean minimal spanning trees
Lee, Sungchul, (2000)
- More ...