2008
DOI: 10.2139/ssrn.1258442
|View full text |Cite
|
Sign up to set email alerts
|

Sparse and Stable Markowitz Portfolios

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

9
153
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 82 publications
(162 citation statements)
references
References 8 publications
(10 reference statements)
9
153
0
Order By: Relevance
“…While the literature offers a significative number of methods for Tikhonov regularization [19], l 1 regularization parameter selection is often based on problem-dependent criteria and related to iterative empirical estimates, that require a high computational cost. In [7] least-angle regression (LARS) algorithm proceeds by decreasing the value of τ progressively from very large values, exploiting the fact that the dependence of the optimal weights on τ is piecewise linear.…”
Section: Modified Bregman Iterationmentioning
confidence: 99%
See 2 more Smart Citations
“…While the literature offers a significative number of methods for Tikhonov regularization [19], l 1 regularization parameter selection is often based on problem-dependent criteria and related to iterative empirical estimates, that require a high computational cost. In [7] least-angle regression (LARS) algorithm proceeds by decreasing the value of τ progressively from very large values, exploiting the fact that the dependence of the optimal weights on τ is piecewise linear.…”
Section: Modified Bregman Iterationmentioning
confidence: 99%
“…In this section, we present a numerical algorithm, based on a modified Bregman iteration with adaptive updating rule for τ . Our basic idea for defining the rule for τ comes from the well-known properties of the l 1 norm and the following proposition [7]:…”
Section: Modified Bregman Iterationmentioning
confidence: 99%
See 1 more Smart Citation
“…To control these weights and avoid calculating the extreme weights in portfolio optimization, first, Jagannathan and Ma (2003) sought to control this issue by modifying the proposed approach by Green and Hollifield (1992) and adding a constraint on the extreme values of stock weights in the portfolio. In this way, a SCAD penalty function was added to the portfolio constraint, for instance, studies by Fan & Li (2001) and Brodie et al (2009) who tried to reduce this problem by considering the penalty function and adding it to the budget constraint of portfolio optimization for certain extreme weights. To improve this issue in the existing literature, Rockafellar et al (2014) proposed the generalized least squares regression in the conditional value at risk minimization approach in portfolio optimization problems to reduce problems in extreme weights.…”
Section: Introductionmentioning
confidence: 99%
“…3 Technically, including too many stocks increases both the odds of overfitting and the difficulty in computing efficient allocation strategies. One way to address this issue is to add a regularization term in the Markowitz mean-variance optimization model (Brodie et al, 2009;Ho et al, 2015).…”
Section: Introductionmentioning
confidence: 99%