Papers › The Boosted Difference of Convex Functions Algorithm for Value-at-Risk Constrained...
The Boosted Difference of Convex Functions Algorithm for Value-at-Risk Constrained Portfolio Optimization
Marah-Lisanne Thormann, Phan Tu Vuong, Alain B. Zemkoho
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A highly relevant problem of modern finance is the design of Value-at-Risk (VaR) optimal portfolios. Due to contemporary financial regulations, banks and other financial institutions are tied to use the risk measure to control their credit, market, and operational risks. Despite its practical relevance, the non-convexity induced by VaR constraints in portfolio optimization problems remains a major challenge. To address this complexity more effectively, this paper proposes the use of the Boosted Difference-of-Convex Functions Algorithm (BDCA) to approximately solve a Markowitz-style portfolio selection problem with a VaR constraint. As one of the key contributions, we derive a novel line search framework that allows the application of the algorithm to Difference-of-Convex functions (DC) programs where both components are non-smooth. Moreover, we prove that the BDCA linearly converges to a Karush-Kuhn-Tucker point for the problem at hand using the Kurdyka-Lojasiewicz property. We also outline that this result can be generalized to a broader class of piecewise-linear DC programs with linear equality and inequality constraints. In the practical part, extensive numerical experiments under consideration of best practices then demonstrate the robustness of the BDCA under challenging constraint settings and adverse initialization. In particular, the algorithm consistently identifies the highest number of feasible solutions even under the most challenging conditions, while other approaches from chance-constrained programming lead to a complete failure in these settings. Due to the open availability of all data sets and code, this paper further provides a practical guide for transparent and easily reproducible comparisons of VaR-constrained portfolio selection problems in Python.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections