Online robust portfolio risk management using total least-squares and parallel splitting algorithms

Konstantinos Slavakis, Geert Leus, Georgios B Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The present paper introduces a novel online asset allocation strategy which accounts for the sensitivity of Markowitz-inspired portfolios to low-quality estimates of the mean and the correlation matrix of stock returns. The proposed methodology builds upon the total least-squares (TLS) criterion regularized with sparsity attributes, and the ability to incorporate additional convex constraints on the portfolio vector. To solve such an optimization task, the present paper draws from the rich family of splitting algorithms to construct a novel online splitting algorithm with computational complexity that scales linearly with the number of unknowns. Real-world financial data are utilized to demonstrate the potential of the proposed technique.

Original languageEnglish (US)
Title of host publication2013 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Proceedings
Pages5686-5690
Number of pages5
DOIs
StatePublished - Oct 18 2013
Event2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Vancouver, BC, Canada
Duration: May 26 2013May 31 2013

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013
Country/TerritoryCanada
CityVancouver, BC
Period5/26/135/31/13

Keywords

  • Markowitz portfolio
  • projection
  • proximal mapping
  • sparsity
  • splitting algorithms
  • total least-squares

Fingerprint

Dive into the research topics of 'Online robust portfolio risk management using total least-squares and parallel splitting algorithms'. Together they form a unique fingerprint.

Cite this