Regularized distributionally robust optimization with application to the index tracking problem

Leyang Zhao (), Guoyin Li () and Spiridon Penev ()
Additional contact information
Leyang Zhao: UNSW Sydney
Guoyin Li: UNSW Sydney
Spiridon Penev: UNSW Sydney

Annals of Operations Research, 2024, vol. 337, issue 1, No 13, 397-424

Abstract: Abstract In recent years, distributionally robust optimization (DRO) has received a lot of interest due to its ability to reduce the worst-case risk when there is a perturbation to the data-generating distribution. A good statistical model is expected to perform well on both the normal and the perturbed data. On the other hand, variable selection and regularization is a research area that aims to identify the important features and remove the redundant ones. It helps to improve the prediction accuracy as well as the interpretability of the model. In this paper, we propose an optimization model that is a regularized version of the canonical distributionally robust optimization (DRO) problem where the ambiguity set is described by a general class of divergence measures that admit a suitable conic structure. The divergence measures we examined include several popular divergence measures used in the literature such as the Kullback–Leibler divergence, total variation, and the Chi-divergence. By exploiting the conic representability of the divergence measure, we show that the regularized DRO problem can be equivalently reformulated as a nonlinear conic programming problem. In the case where the regularization is convex and semi-definite programming representable, the reformulation can be further simplified as a tractable linear conic program and hence can be efficiently solved via existing software. More generally, if the regularization can be written as a difference of convex functions, we demonstrate that a solution for the regularized DRO problem can be found by solving a sequence of conic linear programming problems. Finally, we apply the proposed regularized DRO model to both simulated and real financial data and demonstrate its superior performance in comparison with some non-robust models.

Keywords: Nonconvex optimization; Distributional robustness; Sparse optimization; Index tracking problem (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05726-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:337:y:2024:i:1:d:10.1007_s10479-023-05726-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05726-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().