Accelerated Portfolio Optimization with Conditional Value-at-Risk Constraints using a Cutting-Plane Method

Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This amounts to solving a linear problem. However, in its original formulation this linear problem has a very large number of linear constraints, too...

Full description

Saved in:
Bibliographic Details
Main Author Hofmann, Georg
Format Journal Article
LanguageEnglish
Published 12.08.2014
Subjects
Online AccessGet full text
DOI10.48550/arxiv.1408.2805

Cover

Loading…
Abstract Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This amounts to solving a linear problem. However, in its original formulation this linear problem has a very large number of linear constraints, too many to be enforced in practice. In the literature this is addressed by a reformulation of the problem using so-called dummy variables. This reduces the large number of constraints in the original linear problem at the cost of increasing the number of variables. In the context of reinsurance portfolio optimization we observe that the increase in variable count can lead to situations where solving the reformulated problem takes a long time. Therefore we suggest a different approach. We solve the original linear problem with cutting-plane method: The proposed algorithm starts with the solution of a relaxed problem and then iteratively adds cuts until the solution is approximated within a preset threshold. This is a new approach. For a reinsurance case study we show that a significant reduction of necessary computer resources can be achieved.
AbstractList Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This amounts to solving a linear problem. However, in its original formulation this linear problem has a very large number of linear constraints, too many to be enforced in practice. In the literature this is addressed by a reformulation of the problem using so-called dummy variables. This reduces the large number of constraints in the original linear problem at the cost of increasing the number of variables. In the context of reinsurance portfolio optimization we observe that the increase in variable count can lead to situations where solving the reformulated problem takes a long time. Therefore we suggest a different approach. We solve the original linear problem with cutting-plane method: The proposed algorithm starts with the solution of a relaxed problem and then iteratively adds cuts until the solution is approximated within a preset threshold. This is a new approach. For a reinsurance case study we show that a significant reduction of necessary computer resources can be achieved.
Author Hofmann, Georg
Author_xml – sequence: 1
  givenname: Georg
  surname: Hofmann
  fullname: Hofmann, Georg
BackLink https://doi.org/10.48550/arXiv.1408.2805$$DView paper in arXiv
BookMark eNqFjrsOgkAQRbfQwldvZeYHQFBJaA3R2BiJMbZkAquMLrtkd_D19Yqxt7r35tzi9EVHGy2FGIeBv4ijKJiifdDNDxdB7M_iIOqJyzLPpZIWWRaQGssno8jArmaq6IVMRsOduITE6ILaiQqOqBrpIXt7cteWOLZImh00jvQZEJKG-dO8VKGWsJVcmmIouidUTo5-ORCT9eqQbLyvVFZbqtA-s1Yua-Xmfw9vgOxH3w
ContentType Journal Article
Copyright http://arxiv.org/licenses/nonexclusive-distrib/1.0
Copyright_xml – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0
DBID AKZ
EPD
GOX
DOI 10.48550/arxiv.1408.2805
DatabaseName arXiv Mathematics
arXiv Statistics
arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 1408_2805
GroupedDBID AKZ
EPD
GOX
ID FETCH-arxiv_primary_1408_28053
IEDL.DBID GOX
IngestDate Tue Jul 22 21:58:21 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-arxiv_primary_1408_28053
OpenAccessLink https://arxiv.org/abs/1408.2805
ParticipantIDs arxiv_primary_1408_2805
PublicationCentury 2000
PublicationDate 2014-08-12
PublicationDateYYYYMMDD 2014-08-12
PublicationDate_xml – month: 08
  year: 2014
  text: 2014-08-12
  day: 12
PublicationDecade 2010
PublicationYear 2014
Score 3.086168
SecondaryResourceType preprint
Snippet Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This...
SourceID arxiv
SourceType Open Access Repository
SubjectTerms Mathematics - Optimization and Control
Quantitative Finance - Portfolio Management
Statistics - Applications
Title Accelerated Portfolio Optimization with Conditional Value-at-Risk Constraints using a Cutting-Plane Method
URI https://arxiv.org/abs/1408.2805
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwED2VTiwIxDe03MBqaE2aNGMVUSqk0gVQtsiubVQopGoSxM_vnRMQS8fYlnWKZb_z-d07gGulrIqZPRMSHItA2lhoExn-JICzuqdjzneePoWTl-AxHaQtuPrNhVHrn8V3rQ-si1vy_oc3csgapTtSMmPrYZbWj41eiasZ_jeMPEzf8g8ixvuw1_h2OKoX4wBa9usQ3kfzOR3trMhgkHmbLl8ucpzRVv1sciCRg6GY5Px67CNz-KqWlRWKFT6KD-4pfCmHskDmqb-hwqTyhGXBRYcsTn0d6CPoju-fk4nw1mWrWkgiY7sztvvuGNp027engDoyodNuwIWgg5jQw0S90Fmn-orMlfIMTrZMcr615wJ2CecDDoX25SW0y3VlO4Slpe76P7oB0b97wQ
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Accelerated+Portfolio+Optimization+with+Conditional+Value-at-Risk+Constraints+using+a+Cutting-Plane+Method&rft.au=Hofmann%2C+Georg&rft.date=2014-08-12&rft_id=info:doi/10.48550%2Farxiv.1408.2805&rft.externalDocID=1408_2805