2007
DOI: 10.1007/s10898-007-9221-6
|View full text |Cite
|
Sign up to set email alerts
|

Optimization strategies in credit portfolio management

Abstract: -This paper focuses on the application of an original global optimization algorithm, based on the hybridization between a genetic algorithm and a semi-deterministic algorithm, for the resolution of various constrained optimization problems for realistic credit portfolios. Results are analyzed from a financial point of view in order to confirm their relevance.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
29
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
6

Relationship

5
1

Authors

Journals

citations
Cited by 19 publications
(29 citation statements)
references
References 10 publications
0
29
0
Order By: Relevance
“…More precisely, to study the robustness of each structure λ (α,β) , we consider the random variable Ψ (α,β) = Ψ(ξ, λ (α,β) ) and we approximate its density function ρ Ψ (α,β) using a Monte-Carlo approach [19] (i.e. generating M ∈ IN values of ξ).…”
Section: Numerical Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…More precisely, to study the robustness of each structure λ (α,β) , we consider the random variable Ψ (α,β) = Ψ(ξ, λ (α,β) ) and we approximate its density function ρ Ψ (α,β) using a Monte-Carlo approach [19] (i.e. generating M ∈ IN values of ξ).…”
Section: Numerical Problemmentioning
confidence: 99%
“…Risk measures on L ∞ (Ω, A, IP) are mapping ̟ : L ∞ (Ω, A, IP) → IR where (Ω, A, IP) is a probability space (a complete presentation can be found in [6]). They are used in various areas, such as financial analysis [19], in order to study the value of the worst case scenarios (in our case, the random loads which generate the highest compliances of the structure). Here we focus on a particular and popular risk measure called the Coherent-Value at Risk (C-VaR) [5], defined as: .25)).…”
Section: Numerical Problemmentioning
confidence: 99%
“…In general cases, it could be difficult to evaluate directly IE[Ψ(ξ , ρ)]. We can consider, for instance, a Monte-Carlo algorithm (see [10]) to approximate those values. However, this method, and thus the resolution of (8), is numerically expensive.…”
Section: Theorem 1 Let Us Consider ξ : ω × B → Ir D Be a Random Loadmentioning
confidence: 99%
“…The gradient of the functional to be minimized is approximated with a first order finite difference approach. A complete description and validation of this algorithm can be found in [10,11]. The obtained solutions are denoted by ρ sp for Problem (6)- (7) and ρ ec for Problem (10)- (13) .…”
Section: Problem Descriptionmentioning
confidence: 99%
See 1 more Smart Citation