Autonomous Sparse Mean-CVaR Portfolio Optimization

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Lin, Yizun, Zhang, Yangyu, Lai, Zhao-Rong, Li, Cheng
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909201113022464
author Lin, Yizun
Zhang, Yangyu
Lai, Zhao-Rong
Li, Cheng
author_facet Lin, Yizun
Zhang, Yangyu
Lai, Zhao-Rong
Li, Cheng
contents The $\ell_0$-constrained mean-CVaR model poses a significant challenge due to its NP-hard nature, typically tackled through combinatorial methods characterized by high computational demands. From a markedly different perspective, we propose an innovative autonomous sparse mean-CVaR portfolio model, capable of approximating the original $\ell_0$-constrained mean-CVaR model with arbitrary accuracy. The core idea is to convert the $\ell_0$ constraint into an indicator function and subsequently handle it through a tailed approximation. We then propose a proximal alternating linearized minimization algorithm, coupled with a nested fixed-point proximity algorithm (both convergent), to iteratively solve the model. Autonomy in sparsity refers to retaining a significant portion of assets within the selected asset pool during adjustments in pool size. Consequently, our framework offers a theoretically guaranteed approximation of the $\ell_0$-constrained mean-CVaR model, improving computational efficiency while providing a robust asset selection scheme.
format Preprint
id arxiv_https___arxiv_org_abs_2405_08047
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Autonomous Sparse Mean-CVaR Portfolio Optimization
Lin, Yizun
Zhang, Yangyu
Lai, Zhao-Rong
Li, Cheng
Optimization and Control
Machine Learning
Portfolio Management
The $\ell_0$-constrained mean-CVaR model poses a significant challenge due to its NP-hard nature, typically tackled through combinatorial methods characterized by high computational demands. From a markedly different perspective, we propose an innovative autonomous sparse mean-CVaR portfolio model, capable of approximating the original $\ell_0$-constrained mean-CVaR model with arbitrary accuracy. The core idea is to convert the $\ell_0$ constraint into an indicator function and subsequently handle it through a tailed approximation. We then propose a proximal alternating linearized minimization algorithm, coupled with a nested fixed-point proximity algorithm (both convergent), to iteratively solve the model. Autonomy in sparsity refers to retaining a significant portion of assets within the selected asset pool during adjustments in pool size. Consequently, our framework offers a theoretically guaranteed approximation of the $\ell_0$-constrained mean-CVaR model, improving computational efficiency while providing a robust asset selection scheme.
title Autonomous Sparse Mean-CVaR Portfolio Optimization
topic Optimization and Control
Machine Learning
Portfolio Management
url https://arxiv.org/abs/2405.08047