Portfolio Construction with Gaussian Mixture Returns and Exponential Utility via Convex Optimization
Not on the map. Why?
Abstract (arXiv)
We consider the problem of choosing an optimal portfolio, assuming the asset returns have a Gaussian mixture (GM) distribution, with the objective of maximizing expected exponential utility. In this paper we show that this problem is convex, and readily solved exactly using domain-specific languages for convex optimization, without the need for sampling or scenarios. We then show how the closely related problem of minimizing entropic value at risk can also be formulated as a convex optimization problem.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 May 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025Distribution Transformers: Fast Approximate Bayesian Inference With On-The-Fly Prior Adaptationcited by 13
- 2025ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programmingcited by 3
- 2024Variational Bayes Portfolio Constructioncited by 0
- 2026Generation of Custom Solvers in Rust for Convex Optimizationcited by 0
- 2026Generation of Custom Solvers in Rust for Convex Optimization12 Sep 2026
- 2025ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming8 May 2025
- 2025Distribution Transformers: Fast Approximate Bayesian Inference With On-The-Fly Prior Adaptation4 Feb 2025
- 2024Variational Bayes Portfolio Construction9 Nov 2024