Optimal Reinsurance and Investment via Stochastic Projected Gradient Method Based on Malliavin Calculus

Abstract. This paper proposes a new approach for optimal reinsurance and investment strategies using the stochastic projected gradient method with Malliavin calculus. Unlike existing methodologies, we pursue static investment and reinsurance strategies by directly minimizing the ruin probability. In our setting, the ruin probability minimization problem is formulated as a nonconvex optimization problem over a convex set, and it is shown under suitable assumptions that the gradient of its objective function is Hölder continuous. Additionally, the theoretical guarantee of the proposed method is established by showing the convergence of the stochastic projected gradient method for general convex-constrained optimization problems whose objective function has Hölder continuous gradient. Numerical experiments demonstrate the benefit of directly minimizing the ruin probability.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Financial Mathematics
Published
2026-07-24
DOI
https://doi.org/10.1137/25m1727242
Primary Topic
Risk and Portfolio Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Reinsurance and Investment via Stochastic Projected Gradient Method Based on Malliavin Calculus

Shotaro Yagishita, Yuta Otsuki
SIAM Journal on Financial Mathematics
Risk and Portfolio Optimization
article

Optimal Reinsurance and Investment via Stochastic Projected Gradient Method Based on Malliavin Calculus

Shotaro Yagishita, Yuta Otsuki
article en

Abstract

Abstract. This paper proposes a new approach for optimal reinsurance and investment strategies using the stochastic projected gradient method with Malliavin calculus. Unlike existing methodologies, we pursue static investment and reinsurance strategies by directly minimizing the ruin probability. In our setting, the ruin probability minimization problem is formulated as a nonconvex optimization problem over a convex set, and it is shown under suitable assumptions that the gradient of its objective function is Hölder continuous. Additionally, the theoretical guarantee of the proposed method is established by showing the convergence of the stochastic projected gradient method for general convex-constrained optimization problems whose objective function has Hölder continuous gradient. Numerical experiments demonstrate the benefit of directly minimizing the ruin probability.

SIAM Journal on Financial MathematicsVol. 17(3)
Mitsubishi Research Institute (Japan) (JP), The Institute of Statistical Mathematics (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 5%
Risk and Portfolio Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.