Skip to main content
Log in

Fused Lasso approach in portfolio selection

  • S.I.: Recent Developments in Financial Modeling and Risk Management
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this work we present a new model based on a fused Lasso approach for the multi-period portfolio selection problem in a Markowitz framework. In a multi-period setting, the investment period is partitioned into sub-periods, delimited by the rebalancing dates at which decisions are taken. The model leads to a constrained optimization problem. Two \(l_1\) penalty terms are introduced into the objective function to reduce the costs of the investment strategy. The former is applied to portfolio weights, encouraging sparse solutions. The latter is a penalization on the difference of wealth allocated across the assets between rebalancing dates, thus it preserves the pattern of active positions with the effect of limiting the number of transactions. We solve the problem by means of the Split Bregman iteration. We show results of numerical tests performed on real data to validate our model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. Data available at http://mba.tuck.dartmouth.edu/pages/faculty/ken.french/data_library.html#BookEquity.

References

  • Antonelli, L., & De Simone, V. (2018). Comparison of minimization methods for nonsmooth image segmentation. Communications in Applied and Industrial Mathematics, 9, 68–96.

    Article  Google Scholar 

  • Baccarin, S., & Marazzina, D. (2014). Optimal impulse control of a portfolio with a fixed transaction cost. Central European Journal of Operations Research, 22, 355–372.

    Article  Google Scholar 

  • Baccarin, S., & Marazzina, D. (2016). Passive portfolio management over a finite horizon with a target liquidation value under transaction costs and solvency constraints. IMA Journal of Management Mathematics, 27, 471–504.

    Article  Google Scholar 

  • Barzilai, J., & Borwein, J. (1988). Two-point step size gradient methods. IMA Journal of Numerical Analysis, 8, 141–148.

    Article  Google Scholar 

  • Beck, A., & Guttman-Beck, N. (2018). Fom—A matlab toolbox of first order methods for solving convex optimization problems. Optimization Methods and Software, 34, 172–193.

    Article  Google Scholar 

  • Beck, A., & Teboulle, M. (2009). Gradient-based algorithms with applications to signal recovery. In Y. Eldar, & D. Palomar (Eds.), Convex optimization in signal processing and communications, (pp. 42–88). Cambridge university press.

  • Boyd, S., Mueller, M. T., O’Donoghue, B., & Wang, Y. (2014). Performance bounds and suboptimal policies for multi-period investment. Foundations and Trends in Optimization, 1(1), 1–72.

    Article  Google Scholar 

  • Bregman, L. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7, 200–217.

    Article  Google Scholar 

  • Brodie, J., Daubechies, I., De Mol, C., Giannone, D., & Loris, I. (2009). Sparse and stable markowitz portfolios. PNAS, 30(106), 12267–12272.

    Article  Google Scholar 

  • Corsaro, S., & De Simone, V. (2019). Adaptive \(l_1\)-regularization for short-selling control in portfolio selection. Computational Optimization and Applications, 72(2), 457–478.

    Article  Google Scholar 

  • Corsaro, S., De Simone, V., Marino, Z., & Perla, F. (2018a). L\(_1\)-regularization for multi-period portfolio selection. arXiv:1809.01460

  • Corsaro, S., De Simone, V., Marino, Z., & Perla, F. (2018b). Numerical solution of the regularized portfolio selection problem. In M. Corazza, M. Durbán, A. Grané, C. Perna, & M. Sibillo (Eds.), Mathematical and statistical methods for actuarial sciences and finance (pp. 249–252). Berlin: Springer.

    Chapter  Google Scholar 

  • Cui, X., Gao, J., Li, X., & Li, D. (2014). Optimal multi-period mean-variance policy under no-shorting constraint. European Journal of Operational Research, 234(2), 459–468.

    Article  Google Scholar 

  • De Asmundis, R., di Serafino, D., Hager, W., Toraldo, G., & Zhang, H. (2014). An efficient gradient method using the yuan steplength. Computational Optimization and Applications, 59(3), 541–563.

    Article  Google Scholar 

  • De Asmundis, R., di Serafino, D., Riccio, F., & Toraldo, G. (2013). On spectral properties of steepest descent methods. IMA Journal of Numerical Analysis, 32, 1416–1435.

    Article  Google Scholar 

  • DeMiguel, V., Garlappi, L., & Uppal, R. (2009). Optimal versus naive diversification: How inefficient is the 1-n portfolio strategy? The Review of Financial Studies, 22(5), 1915–1953.

    Article  Google Scholar 

  • di Serafino, D., Ruggiero, V., Toraldo, G., & Zanni, L. (2018). On preconditioner updates for sequences of saddle-point linear systems. Applied Mathematics and Computation, 318, 176–195.

    Article  Google Scholar 

  • Goldstein, T., Bresson, X., & Osher, S. (2010). Geometric applications of the split bregman method: Segmentation and surface reconstruction. Journal of Scientific Computing, 45(1–3), 272–293.

    Article  Google Scholar 

  • Goldstein, T., & Osher, S. (2009). The split bregman for l1-regularization problems. SIAM Journal on Imaging, 2(2), 323–343.

    Article  Google Scholar 

  • Ho, M., Sun, Z., & Xin, J. (2015). Weighted elastic net penalized mean-variance portfolio design and computation. SIAM Journal on Financial Mathematics, 6(1), 1220–1244.

    Article  Google Scholar 

  • Li, D., & Ng, W. (2000). Optimal dynamic portfolio selection: Multiperiod mean-variance formulation. Mathematical Finance, 10(3), 387–406.

    Article  Google Scholar 

  • Nystrup, P., Boyd, S., Lindström, E., & Madsen, H. (2018). Multi-period portfolio selection with drawdown control. Annals of Operations Research. https://doi.org/10.1007/s10479-018-2947-3.

  • Olivares-Naldal, A. V., & DeMiguel, V. (2018). Technical note—A robust perspective on transaction costs in portfolio optimization. Operations Research, 66(3), 597–892.

    Article  Google Scholar 

  • Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005). An iterative regularization method for total variation-based image restoration. SIAM Multiscale Modeling and Simulation, 4(2), 460–489.

    Article  Google Scholar 

  • Parikh, N., & Boyd, S. (2014). Proximal algorithms. Foundations and Trends in Optimization, 1(3), 127–239.

    Article  Google Scholar 

  • Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005). Sparsity and smoothness via the fused Lasso. Journal of the Royal Statistical Society. Series B (Statistical Methodology), 67(1), 91–98.

    Article  Google Scholar 

  • Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008). Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM Journal on Imaging Sciences, 1(1), 143–168.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zelda Marino.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was partially funded by Research Grant of Università Parthenope, DR No. 953, November 28th, 2016 and INdAM-GNCS Project 2018.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Corsaro, S., De Simone, V. & Marino, Z. Fused Lasso approach in portfolio selection. Ann Oper Res 299, 47–59 (2021). https://doi.org/10.1007/s10479-019-03289-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-019-03289-w

Keywords

Mathematics Subject Classification

Navigation