2023
DOI: 10.1109/tnnls.2022.3171819
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Index Tracking With K-Sparsity or ϵ-Deviation Constraint via ℓ0-Norm Minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 55 publications
0
3
0
Order By: Relevance
“…Te data are generated from model (19) and model (20), and ρ is, respectively, taken as 0.01, 0.5, 5, 10, 20, and 50.…”
Section: Numerical Simulationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Te data are generated from model (19) and model (20), and ρ is, respectively, taken as 0.01, 0.5, 5, 10, 20, and 50.…”
Section: Numerical Simulationsmentioning
confidence: 99%
“…Recently, many researchers adopted ADMM algorithm to high-dimensional statistics and machine learning, see Yin et al [14], Xue et al [15], Zhang and Zou [16], Gu et al [17], and Kapla et al [18], and many other topics, such as matrix completion, tensor completion, and sparse recovery, see Li et al [19,20], Liu et al [21], and Shi et al [22]. Te main advantages of the ADMM algorithm are its fexibility at simplifying a diversity of optimization problems and its good convergence property, see Boyd et al [23].…”
Section: Introductionmentioning
confidence: 99%
“…To test the performance of the index tracking methods, we adopt the rolling window scheme [5], [8]. The first T train time-frames are used to design the first portfolio, which will be used for out-of-sample testing in the next T test timeframes.…”
Section: Experiments a Dataset And Settingsmentioning
confidence: 99%
“…Another straightforward approach is to evenly distribute capital across all assets composing the index, effectively creating a fully and uniformly weighted portfolio. However, this strategy has notable disadvantages: firstly, it necessitates substantial trading with each rebalance, inflating transaction costs; secondly, it incorporates small and illiquid assets, The objective of sparse index tracking [4]- [8] is to construct a sparse portfolio w ∈ R N , matching the performance of the benchmark market index, with K(<< N ) nonzero weights out of N total assets.…”
Section: Introductionmentioning
confidence: 99%
“…To address this problem, an alternative method is explored in this paper. It has been proven by some studies [ 30 , 31 , 32 , 33 ] that the nonconvex optimization problem of the L0 norm is relaxed to an L1 norm minimization problem that can also obtain a sparse solution. In other words, the L1 norm constraint makes the problem to be solved behave as a convex optimization problem and can thus obtain the optimal solution by using the linear programming method.…”
Section: Sparse Time-frequency Decomposition Of Proximal Gradient Des...mentioning
confidence: 99%