The boosted difference of convex functions algorithm for value-at-risk constrained portfolio optimization
The boosted difference of convex functions algorithm for value-at-risk constrained portfolio optimization
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.
Thormann, Marah-Lisanne
dde44d2b-814a-48e3-96d5-797cb021cfa4
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Zemkoho, Alain
30c79e30-9879-48bd-8d0b-e2fbbc01269e
14 February 2024
Thormann, Marah-Lisanne
dde44d2b-814a-48e3-96d5-797cb021cfa4
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Zemkoho, Alain
30c79e30-9879-48bd-8d0b-e2fbbc01269e
Thormann, Marah-Lisanne, Vuong, Phan Tu and Zemkoho, Alain
(2024)
The boosted difference of convex functions algorithm for value-at-risk constrained portfolio optimization.
arXiv.
(doi:10.48550/arXiv.2402.09194).
Abstract
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.
This record has no associated files available for download.
More information
Published date: 14 February 2024
Identifiers
Local EPrints ID: 506449
URI: http://eprints.soton.ac.uk/id/eprint/506449
ISSN: 2331-8422
PURE UUID: 08d3c52c-4732-4822-aefc-4c51e0cbcfa2
Catalogue record
Date deposited: 07 Nov 2025 17:39
Last modified: 08 Nov 2025 02:59
Export record
Altmetrics
Contributors
Author:
Marah-Lisanne Thormann
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics