Optimization problems in the simulation of multifactor portfolio credit risk

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 264
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKang, Wanmoko
dc.contributor.authorLee, Kko
dc.date.accessioned2019-03-08T09:23:16Z-
dc.date.available2019-03-08T09:23:16Z-
dc.date.created2012-02-06-
dc.date.issued2006-
dc.identifier.citationCOMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3 BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3982, pp.777 - 784-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10203/251094-
dc.description.abstractWe consider some optimization problems arising in an efficient simulation method for the measurement of the tail of portfolio credit risk. When we apply an importance sampling (IS) technique, it is necessary to characterize the important regions. In this paper, we consider the computation of directions for the IS, which becomes hard in multifactor case. We show this problem is NP-hard. To overcome this difficulty, we transform the original problem to subset sum and quadratic optimization problems. We support numerically that these reformulation is computationally tractable.-
dc.languageEnglish-
dc.publisherSPRINGER-VERLAG BERLIN-
dc.titleOptimization problems in the simulation of multifactor portfolio credit risk-
dc.typeArticle-
dc.identifier.wosid000237648300082-
dc.identifier.scopusid2-s2.0-33745896815-
dc.type.rimsART-
dc.citation.volume3982-
dc.citation.beginningpage777-
dc.citation.endingpage784-
dc.citation.publicationnameCOMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3 BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE-
dc.contributor.localauthorKang, Wanmo-
dc.contributor.nonIdAuthorLee, K-
dc.type.journalArticleArticle; Proceedings Paper-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0