<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "https://jats.nlm.nih.gov/publishing/1.3/JATS-journalpublishing1-3.dtd"><article xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" dtd-version="1.3" article-type="research-article"><front><journal-meta><journal-id journal-id-type="issn">2460-0245</journal-id><journal-title-group><journal-title>Journal of the Indonesian Mathematical Society</journal-title><abbrev-journal-title>JIMS</abbrev-journal-title></journal-title-group><issn pub-type="epub">2460-0245</issn><issn pub-type="ppub">2086-8952</issn><publisher><publisher-name>IndoMS</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22342/jims.v32i2.1773</article-id><article-categories></article-categories><title-group><article-title>Range Value-at-Risk and Its Optimization in Vehicle Insurance</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Josaphat</surname><given-names>Bony Parulian</given-names></name><address><country country="ID">Indonesia</country><email>bonyp@stis.ac.id</email></address><xref ref-type="aff" rid="AFF-1"></xref><xref ref-type="corresp" rid="cor-0"></xref></contrib><contrib contrib-type="author"><name><surname>Ansori</surname><given-names>Moch Fandi</given-names></name><address><country country="ID">Indonesia</country><email>mochfandiansori@lecturer.undip.ac.id</email></address><xref ref-type="aff" rid="AFF-2"></xref></contrib></contrib-group><contrib-group><contrib contrib-type="editor"><name><surname>Wijayanti</surname><given-names>Indah Emilia</given-names></name><address><country country="ID">Indonesia</country><email>ind_wijayanti@ugm.ac.id</email></address><xref ref-type="aff" rid="EDITOR-AFF-1"></xref></contrib></contrib-group><aff id="AFF-1"><institution content-type="dept">Department of Statistical Computing</institution><institution-wrap><institution>Politeknik Statistika STIS</institution><institution-id institution-id-type="ror">https://ror.org/034k8m376</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><aff id="AFF-2"><institution content-type="dept">Department of Mathematics</institution><institution-wrap><institution>Diponegoro University</institution><institution-id institution-id-type="ror">https://ror.org/056bjta22</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><aff id="EDITOR-AFF-1"><institution-wrap><institution>Universitas Gadjah Mada</institution><institution-id institution-id-type="ror">https://ror.org/03ke6d638</institution-id></institution-wrap><country country="ID">Indonesia</country></aff><author-notes><corresp id="cor-0">Corresponding author: Bony Parulian Josaphat. Email: <email>bonyp@stis.ac.id</email></corresp></author-notes><pub-date date-type="pub" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><pub-date date-type="collection" iso-8601-date="2026-04-23" publication-format="electronic"><day>23</day><month>04</month><year>2026</year></pub-date><volume>32</volume><issue>2</issue><issue-title>JUNE</issue-title><fpage>1</fpage><lpage>16</lpage><history><date date-type="received" iso-8601-date="2024-08-09"><day>09</day><month>08</month><year>2024</year></date><date date-type="accepted" iso-8601-date="2025-11-09"><day>09</day><month>11</month><year>2025</year></date></history><permissions><copyright-statement>Copyright (c) 2026 Journal of the Indonesian Mathematical Society</copyright-statement><copyright-year>2026</copyright-year><copyright-holder>Journal of the Indonesian Mathematical Society</copyright-holder><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by-nc-nd/4.0/"><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc-nd/4.0/</ali:license_ref><license-p>This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.</license-p></license></permissions><self-uri xlink:href="https://jims-a.org/index.php/jimsa/article/view/1773" xlink:title="1773"></self-uri><abstract><p>A popular risk measure is tail value-at-risk (TVaR), which is the mean of a random risk's losses above the value-at-risk (VaR). Moreover, TVaR is the most popular competitor of VaR. However, TVaR has some theoretical obstacles; for example, it does not exist when the risk distribution has a very heavy tail or has an infinite mean. In practice, this may compel financial institutions or insurance companies to deposit additional funds to fulfill requisites specified by regulators. Many authors suggested using a generalization of TVaR known as range value-atrisk (RVaR), which measures the actual risk of an aggregated risk. Furthermore, we suggest the range conditional tail variance (RCTV), a second conditional moment of the tail distribution with the RVaR at its center. RVaR and RCTV are significantly more flexible than TVaR and conditional tail variance (CTV) since they both have a contraction parameter. We also provide analytical formulations for the RVaR and RCTV of exponentially distributed risk. This article proposes an optimization method for the RVaR by applying the Newton method and a metaheuristic algorithm, spiral optimization (SpO). We use the Newton technique and SpO with RCTV and CTV to find the contraction parameter that optimizes RVaR. This study shows the use of RVaR optimization to forecast the RVaR of vehicle insurance claim amounts in Australia. We find that the SpO method produces the estimation result quite well as noticed by the quadratic form of objective function converging to zero. On the other hand, the Newton method produces not only similar results for the estimation but also has less RVaR at the same probability levels, which means better in lowering the magnitude of TVaR. However, the empirical results show that, compared with Newton's method, the SpO method captures the RVaR more successfully.</p></abstract><kwd-group><kwd>Insurance claim</kwd><kwd>Newton method</kwd><kwd>RCTV</kwd><kwd>RVaR</kwd><kwd>Spiral optimization</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>File created by JATS Editor</meta-name><meta-value>https://jatseditor.com</meta-value></custom-meta><custom-meta><meta-name>issue-created-year</meta-name><meta-value>2026</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="sec-1"><title>1. INTRODUCTION</title><p>There have been numerous risk measures proposed in the subject of quantitative risk management, the two most well-known of which are the value-at-risk (VaR) and the tail value-at-risk. VaR is the greatest loss in a period for a given confidence level, whereas TVaR is the mean loss after VaR is exceeded. As VaR has been approved by the Basel Committee <xref ref-type="bibr" rid="BIBR-1">[1]</xref>, it has emerged as the standard measurement of risk in the financial markets. Despite its simplicity and ease of application, VaR lacks coherence as a risk measure in the sense that <xref ref-type="bibr" rid="BIBR-2">[2]</xref> suggests. This is because VaR does not meet subadditivity, which means that the VaR of an aggregated risk is not necessarily less than the total of the VaRs of the individual risks that make up the aggregate, contrary to the principle of diversification. Furthermore, the VaR ignores the possibility of losses outside the considered quantile.</p><p>On the other hand, the TVaR, which accounts for losses beyond the VaR, is the most popular competitor for VaR. TVaR was proposed properly as a solution to VaR’s limitations in terms of risk sensitivity. Furthermore, at some confidence level, TVaR equals the conditional expected value of losses that are greater than or equal to VaR. Since TVaR is a coherent measure of risk <xref ref-type="bibr" rid="BIBR-2">[2]</xref>, it has been considerably implemented by financial institutions. However, TVaR has some theoretical hurdles, such as not existing for distributions with a very heavy tail or infinite mean <xref ref-type="bibr" rid="BIBR-3">[3]</xref>, i.e., it relies heavily on the extreme tail of the return distribution, potentially overestimating the original risk <xref ref-type="bibr" rid="BIBR-4">[4]</xref>. Nonetheless, regulatory agencies apply both risk measures; VaR more in banking, while TVaR more in insurance <xref ref-type="bibr" rid="BIBR-1">[1]</xref>. Furthermore, Li <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-5">[5]</xref> argued that RVaR may be considered as a trestle between VaR and TVaR and is robust in the sense that it is continuous in relation to the weak convergence of random variables, whereas neither TVaR nor VaR is continuous generally.</p><p>In particular, Jiang <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-6">[6]</xref> implemented RVaR to illustrate the applicability of Pareto-optimal reinsurance policies that incorporate both the insurer’s and reinsurer’s risks and returns. Wang and Wei <xref ref-type="bibr" rid="BIBR-7">[7]</xref> identified and characterized Pareto-optimal allocations in quantile-based risk-sharing problems within the RVaR family. Li <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-5">[5]</xref> developed worst-case values and scenarios for RVaR under partial information assumption, for both single and aggregate risk models. Moreover, Fissler and Ziegel <xref ref-type="bibr" rid="BIBR-8">[8]</xref> statistically assessed, compared, and ranked the predictive performance of diferent RVaR models.</p><p>To overcome those limitations of VaR and TVaR simultaneously, we propose investigating the role of RVaR by finding a technique to optimize RVaR. Moreover, the existence of the contraction parameter <inline-formula><tex-math id="math-1"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a > 0 \end{document} ]]></tex-math></inline-formula> gives RVaR some flexibility. Instead of infinite, this parameter can be applied to provide an upper bound on the risk for values that exceed VaR. As a result, when we construct the RVaR forecast, it reduces the size of the loss beyond VaR, making it smaller than the TVaR forecast. This is a useful characteristic in risk modeling, particularly when dealing with high-variability portfolio returns or data with outliers. Nevertheless, Jadhav <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-4">[4]</xref> only set the values of a while computing RVaR rather than optimizing RVaR.</p><p>Furthermore, none of the previously listed authors (<xref ref-type="bibr" rid="BIBR-5">[5]</xref>, <xref ref-type="bibr" rid="BIBR-6">[6]</xref>, <xref ref-type="bibr" rid="BIBR-8">[8]</xref>, <xref ref-type="bibr" rid="BIBR-7">[7]</xref>, and <xref ref-type="bibr" rid="BIBR-9">[9]</xref>) ofered a numerical optimization technique to ascertain parameter <inline-formula><tex-math id="math-2"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> directly or indirectly.</p><p>Besides TVaR, risk variability in the tail region of the distribution to the right of VaR was also noted by certain investigators. Essentially, the idea is that, regardless of the intended features and usefulness, TVaR only considers the mean losses on the tail and ignores variability, therefore it makes sense to include a second central moment or variance of the tail distribution. Thus, tail variance, or CTV, is a variability measure introduced by Furman <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-10">[10]</xref>. Following <xref ref-type="bibr" rid="BIBR-10">[10]</xref>, we then suggest a variability measure surrounding RVaR that is subject to the same restriction. We refer to this measure as range conditional tail variance (RCTV). We consider this measure because we believe that RCTV provides a better comprehension of the behavior of a risk throughout the tail of its distribution.</p><p>The goal of this study is to present an optimization technique for indirectly estimating the value of parameter <inline-formula><tex-math id="math-3"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> that maximizes RVaR while being constrained by RCTV and CTV. The Lagrangian approach is used to convert the constrained maximization problem into a problem of solving a system of nonlinear equations. The transformed problem is now a problem of unconstrained minimization. In this study, two methods are used to solve the RVaR optimization problem: Newton and spiral optimization (SpO) methods. Recently, the Newton method as well as its variants have been extensively used in a variety of optimization problems [<xref ref-type="bibr" rid="BIBR-11">11</xref>, <xref ref-type="bibr" rid="BIBR-12">12</xref>, <xref ref-type="bibr" rid="BIBR-13">13</xref>, <xref ref-type="bibr" rid="BIBR-14">14</xref>]. We choose Newton method because it can achieve convergence quickly. Of course, the method requires the selection of appropriate initial conditions as well as the calculation of the Jacobian matrix. Many people avoid Newton’s method due to the dificulties of deriving the Jacobian matrix. Moreover, they do not want to face the Jacobian matrix becoming singular for some points and at some iteration. In our unconstrained problem, we can still derive the Jacobian matrix although it has a long expression. The elements of the Jacobian matrix are given in Appendix. On the other hand, the spiral phenomena in nature serves as the foundation for the SpO method, a metaheuristic algorithm. This method was first introduced in <xref ref-type="bibr" rid="BIBR-15">[15]</xref>. Many researchers have used the SpO method in tackling a range of optimization problems [<xref ref-type="bibr" rid="BIBR-16">16</xref>, <xref ref-type="bibr" rid="BIBR-17">17</xref>, <xref ref-type="bibr" rid="BIBR-18">18</xref>, <xref ref-type="bibr" rid="BIBR-19">19</xref>] including an optimization problem in energy risk using copula-based extended value-at-risk <xref ref-type="bibr" rid="BIBR-20">[20]</xref>. We favor the SpO method over other metaheuristic methods because the updating points scheme is deterministic. The stochastic terms only appear in the initialization, not in the updating scheme. Therefore, this method is quite quicker than other metaheuristic methods.</p><p>The order of the remaining text is as follows. We provide a quick overview of RVaR in Section <xref ref-type="sec" rid="9ec6c3d2-2225-77ae-66c7-487648c31778">2</xref>. The second conditnal central moment of the distribution tail, with RVaR as the center, is given in Section <xref ref-type="sec" rid="324f49d4-2543-e7be-cdc2-767ec0168ceb">3</xref>. Section <xref ref-type="sec" rid="e068a96f-d53c-9e0b-b564-7085600582ca">4</xref> explains the RVaR optimization approach in depth, whereas Section <xref ref-type="sec" rid="e9125270-2d91-77b4-f9d7-83f0791786f3">5</xref> applies it to an insurance claim. Section <xref ref-type="sec" rid="321d5df9-c761-7735-2d20-927f6805c7b4">6</xref> ofers a conclusion to the article. A proof, two analytical examples, and derivation of partial derivatives are relegated to Appendix.</p></sec><sec id="sec-2"><title>2. RANGE VALUE-AT-RISK</title><p>Let <inline-formula><tex-math id="math-4"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \Omega , \mathcal { F } , \operatorname* { P r } ) \end{document} ]]></tex-math></inline-formula> be a probability space and define <inline-formula><tex-math id="math-5"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> as the set of random risks (with finite means) defined on <inline-formula><tex-math id="math-6"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( \Omega , \mathcal { F } , \operatorname* { P r } ) \end{document} ]]></tex-math></inline-formula>. A risk measure is a functional <inline-formula><tex-math id="math-7"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \varrho : L \rightarrow \mathbb{R} \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-8"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \mapsto \varrho ( L ) \end{document} ]]></tex-math></inline-formula>. Let <inline-formula><tex-math id="math-9"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> be a random risk whose marginal d.f. <inline-formula><tex-math id="math-10"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F _ { L } \end{document} ]]></tex-math></inline-formula> is assumed to be a strictly increasing function. The value-at-risk (VaR) of <inline-formula><tex-math id="math-11"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> at probability level <inline-formula><tex-math id="math-12"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> is the quantile <inline-formula><tex-math id="math-13"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Q _ { \alpha } \end{document} ]]></tex-math></inline-formula> of <inline-formula><tex-math id="math-14"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle F _ { L } \end{document} ]]></tex-math></inline-formula> given a value <inline-formula><tex-math id="math-15"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in ( 0 , 1 ) \end{document} ]]></tex-math></inline-formula>, typically close to one. Following is the definition of the VaR mathematically.</p><disp-formula id="equation-1"><tex-math id="math-16"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Q _ {\alpha} = F _ {L} ^ {- 1} (\alpha).\tag{1} \end{document} ]]></tex-math></disp-formula><p>In the formulation (2), the tail value-at-risk (TVaR) is defined as follows,</p><disp-formula id="equation-2"><tex-math id="math-17"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{TVaR} _ {\alpha} (L) = E [ L | L \geq Q _ {\alpha} (L) ] = \frac {1}{1 - \alpha} \int_ {\alpha} ^ {1} Q _ {p} (L) \mathrm{d} p.\tag{2} \end{document} ]]></tex-math></disp-formula><p>Formulation (3) defines the range value-at-risk (RVaR).</p><disp-formula id="equation-3"><tex-math id="math-18"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RVaR} _ {(\alpha , a)} (L) = E \left[ L \mid Q _ {\alpha} \leq L \leq Q _ {\alpha_ {1}} \right] = \frac {\int_ {\alpha} ^ {\alpha_ {1}} Q _ {p} (L) \mathrm{d} p}{(1 - \alpha) ^ {a + 1}},\tag{3} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-19"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } = \alpha + ( 1 - \alpha ) ^ { 1 + a } , a \geq 0 \end{document} ]]></tex-math></inline-formula>. Here, <inline-formula><tex-math id="math-20"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> denotes the probability level, while <inline-formula><tex-math id="math-21"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> denotes the contraction parameter. In simpler terms, <inline-formula><tex-math id="math-22"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { R V a R } _ { ( \alpha , a ) } \end{document} ]]></tex-math></inline-formula> is the mean of quantiles between probability levels α and <inline-formula><tex-math id="math-23"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } \end{document} ]]></tex-math></inline-formula>. This modified risk measure has long been projected to reduce the impact of exceptionally high-valued returns, making it a sort of truncated TVaR.<target id="anchor-8239d4af-b2ff-47a5-b0ee-74085a4a674c" target-type="reference-target"/></p><p><bold>Remark 2.1.</bold> When we set <inline-formula><tex-math id="math-24"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a = 0 \end{document} ]]></tex-math></inline-formula>, then RVaR collapses into TVaR given in (2).<target id="anchor-50350307-8021-43f4-b726-f1a5f920c923" target-type="reference-target"/></p><p><bold>Remark 2.2.</bold> RVaR can also be written as follows,</p><disp-formula id="equation-4"><tex-math id="math-25"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{RVaR} _ {(\alpha , a)} (L) = \frac {1}{(1 - \alpha) ^ {a + 1}} \Big [ (1 - \alpha) \mathrm{TVaR} _ {\alpha} (L) - (1 - \alpha_ {1}) \mathrm{TVaR} _ {\alpha_ {1}} (L) \Big ].\tag{4} \end{document} ]]></tex-math></disp-formula></sec><sec id="sec-3"><title>3. RANGE CONDITIONAL TAIL VARIANCE</title><p>The RVaR, like the TVaR, determines mean losses in the tail of its distribution. Meanwhile, the second central moment or variance in the tail must be determined in order to generate a new risk measure involving variability. Valdez et al. <xref ref-type="bibr" rid="BIBR-21">[21]</xref> and Furman et al. <xref ref-type="bibr" rid="BIBR-10">[10]</xref> proposed a risk measure called tail variance (TV) or conditional tail variance (CTV) to study the variability of risk on the tail in relation to TVaR, which is given below,</p><disp-formula id="equation-5"><tex-math id="math-26"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{CTV} _ {\alpha} (L) = E \big [ \big (L - \mathrm{TVaR} _ {\alpha} (L) \big) ^ {2} \big | L \geq Q _ {\alpha} \big ]. \end{document} ]]></tex-math></disp-formula><p>In this section, we introduce a new risk measurure <xref ref-type="fn" rid="fn-1">1</xref>called range conditional tail variance (RCTV), which is a rescaled version of CTV. CTV is closely connected to CTV, and so is RCTV to RVaR. The RCTV of <inline-formula><tex-math id="math-27"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> is defined as follows.</p><p><target id="anchor-38bae8f2-4189-4c5a-8e66-0c2b8038d829" target-type="reference-target"/></p><p><bold>Definition 3.1.</bold><italic>Suppose </italic><inline-formula><tex-math id="math-28"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> represents a risk. Assume </italic><inline-formula><tex-math id="math-29"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle Q _ { p } \end{document} ]]></tex-math></inline-formula><italic> represents the VaR of </italic><inline-formula><tex-math id="math-30"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> at probability level </italic><inline-formula><tex-math id="math-31"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle p \end{document} ]]></tex-math></inline-formula><italic>, and </italic><inline-formula><tex-math id="math-32"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { R V a R } _ { ( \alpha , a ) } \end{document} ]]></tex-math></inline-formula><italic> represents the RVaR of </italic><inline-formula><tex-math id="math-33"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> in (3). The range conditional tail variance (RCTV) of </italic><inline-formula><tex-math id="math-34"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> can be calculated as follows,</italic></p><disp-formula id="equation-6"><tex-math id="math-35"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RCTV} _ {(\alpha , a)} (L) = E \left[ \left(L - \operatorname{RVaR} _ {(\alpha , a)} (L)\right) ^ {2} \mid Q _ {\alpha} \leq L \leq Q _ {\alpha_ {1}} \right].\tag{5} \end{document} ]]></tex-math></disp-formula><p>As a result, RCTV is a variability measure of risk <inline-formula><tex-math id="math-36"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> around RVaR that is trimmed by two quantiles. RCTV is a more generalized form of CTV. The RCTV formula for risk <inline-formula><tex-math id="math-37"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> is presented in the following lemma. The proof is omitted here.<target id="anchor-52e82357-57c1-40bd-be95-7b10c42ffadd" target-type="reference-target"/></p><p><bold>Lemma 3.2.</bold><italic>Suppose that </italic><inline-formula><tex-math id="math-38"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> denotes a random risk. Let </italic><inline-formula><tex-math id="math-39"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \in ( 0 , 1 ) \end{document} ]]></tex-math></inline-formula><italic> and </italic><inline-formula><tex-math id="math-40"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a > 0 \end{document} ]]></tex-math></inline-formula><italic>. Then, the RCTV of </italic><inline-formula><tex-math id="math-41"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula><italic> is given by,</italic></p><disp-formula id="equation-7"><tex-math id="math-42"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{RCTV} _ {(\alpha , a)} (L) = \frac {\int_ {\alpha} ^ {\alpha_ {1}} \left(Q _ {p} (L)\right) ^ {2} \mathrm{d} p}{(1 - \alpha) ^ {a + 1}} - \left(\mathrm{RVaR} _ {(\alpha , a)} (L)\right) ^ {2},\tag{6} \end{document} ]]></tex-math></disp-formula><p>with <inline-formula><tex-math id="math-43"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { R V a R } _ { ( \alpha , a ) } ( L ) \end{document} ]]></tex-math></inline-formula> is given in (4).</p><p>The following theorem provides properties that hold for the variability measure of RCTV.<target id="anchor-588d1f15-e94f-4ad8-94a1-070924684907" target-type="reference-target"/></p><p><bold>Theorem 3.3.</bold><italic>The measure of RCTV fulfills the following properties:</italic></p><list list-type="order"><list-item><p>: <italic>For any constant</italic><inline-formula><tex-math id="math-44"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k > 0 \end{document} ]]></tex-math></inline-formula>, we have  <inline-formula><tex-math id="math-45"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname { RCTV } _ { ( \alpha , a ) } { \big ( } ( k { + } L ) { \big ) } = k { + } \mathrm { R C T V } _ { ( \alpha , a ) } ( L ) \end{document} ]]></tex-math></inline-formula>.</p></list-item><list-item><p>: <italic>For any constant </italic><inline-formula><tex-math id="math-46"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k > 0 \end{document} ]]></tex-math></inline-formula>, <italic>we have </italic><inline-formula><tex-math id="math-47"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname { RC T V } _ { ( \alpha , a ) } ( k L ) = k ^ { 2 } \operatorname { R C T V } _ { ( \alpha , a ) } ( L ) \end{document} ]]></tex-math></inline-formula>.</p></list-item></list><p><italic>Proof.</italic> (1): For any constant <inline-formula><tex-math id="math-48"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k > 0 \end{document} ]]></tex-math></inline-formula>, we have,</p><disp-formula id="equation-8"><tex-math id="math-49"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RCTV} _ {(\alpha , a)} (k + L) = E \left[ \left(k + L - \operatorname{RVaR} _ {(\alpha , a)} (k + L)\right) ^ {2} \mid Q _ {\alpha} (k + L) \leq k + L \leq Q _ {\alpha_ {1}} (k + L) \right]. \end{document} ]]></tex-math></disp-formula><p>Since both VaR and RVaR satisfiy the property of translation invariance, then,</p><disp-formula id="equation-9"><tex-math id="math-50"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{align*}\text{RCTV}_{(\alpha,a)}(k+L)&= E\left[ \left(k + L - k - \text{RVaR}_{(\alpha,a)}(L)\right)^2 \middle| k + Q_{\alpha}(L) \le k + L \le k + Q_{\alpha_1}(L) \right] \\&= E\left[ \left(L - \text{RVaR}_{(\alpha,a)}(L)\right)^2 \middle| Q_{\alpha}(L) \le L \le Q_{\alpha_1}(L) \right] \\&= \text{RCTV}_{(\alpha,a)}(L).\end{align*} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-10"><tex-math id="math-51"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-11"><tex-math id="math-52"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><p>(2):For any constant <inline-formula><tex-math id="math-53"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k > 0 \end{document} ]]></tex-math></inline-formula>, we have,</p><disp-formula id="equation-12"><tex-math id="math-54"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RCTV} _ {(\alpha , a)} (k L) = E \left[ \left(k L - \operatorname{RVaR} _ {(\alpha , a)} (k L)\right) ^ {2} \mid Q _ {\alpha} (k L) \leq k L \leq Q _ {\alpha_ {1}} (k L) \right]. \end{document} ]]></tex-math></disp-formula><p>     Since both VaR and RVaR satisfy the property of positive homogeneity, then,</p><disp-formula id="equation-13"><tex-math id="math-55"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{align*}\text{RCTV}_{(\alpha,a)}(k L)&= E\left[ \left(k L - k \text{RVaR}_{(\alpha,a)}(L)\right)^2 \middle| k Q_{\alpha}(L) \le k L \le k Q_{\alpha_1}(L) \right] \\&= E\left[ k^2 \left(L - \text{RVaR}_{(\alpha,a)}(L)\right)^2 \middle| Q_{\alpha}(L) \le L \le Q_{\alpha_1}(L) \right] \\&= k^2 \text{RCTV}_{(\alpha,a)}(L).\end{align*} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-14"><tex-math id="math-56"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-15"><tex-math id="math-57"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><p>We illustrate RCTV for exponential distribution via Example <xref ref-type="custom" custom-type="reference-target" rid="anchor-7c150fe8-5bec-4d0e-86eb-f1a2fdb964d8">6.2</xref> in the Ap-pendix.</p></sec><sec id="sec-4"><title>4. RVAR OPTIMIZATION USING RCTV AND CTV</title><p>Remember that RVaR is defined as follows,</p><disp-formula id="equation-16"><tex-math id="math-58"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RVaR} _ {(\alpha , a)} (L) = E \left[ L \mid Q _ {\alpha} \leq L \leq Q _ {\alpha_ {1}} \right].\tag{7} \end{document} ]]></tex-math></disp-formula><p>This section explains the RVaR optimization issue under a constraint consisting of RCTV and CTV. Moreover, RVaR, RCTV, and CTV can be interpreted as functions of <inline-formula><tex-math id="math-59"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-60"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula>. The optimization is done to get the values of contraction parameter <inline-formula><tex-math id="math-61"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> that maximize RVaR by introducing a constraint: the corresponding <italic>k</italic>RCTV must be equal to CTV for some multiplier <inline-formula><tex-math id="math-62"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \in \mathbb { R } ^ { + } \end{document} ]]></tex-math></inline-formula>. The selection of this constraint is in line with Josaphat <italic>et al</italic>. <xref ref-type="bibr" rid="BIBR-20">[20]</xref> , specifically in Eq. 10. They proposed a more complicated constraint, namely <italic>k</italic>DCTV-CTV, which involves dependence and copula. Since this research does not involve dependence, <italic>k</italic>DCTV-CTV becomes simply <italic>k</italic>RCTV-CTV. Thus, the RVaR optimization is provided as,</p><disp-formula id="equation-17"><tex-math id="math-63"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}\operatorname{RVaR}_{(\alpha,\alpha^*)}(L)&=\max_{a>0}\operatorname{RVaR}_{(\alpha,a)}(L)\\&\quad\text{s.t. }k\operatorname{RCTV}_{(\alpha,a)}(L)-\operatorname{CTV}_{\alpha}(L)=0\end{aligned}\tag{8}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>However, determining <inline-formula><tex-math id="math-64"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> that maximizes (8) is not simple. To do this, we apply the transformation of <inline-formula><tex-math id="math-65"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula>, which is <inline-formula><tex-math id="math-66"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } = \alpha + ( 1 - \alpha ) ^ { 1 + a } \end{document} ]]></tex-math></inline-formula>. Since <inline-formula><tex-math id="math-67"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < \alpha < 1 \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-68"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a > 0 \end{document} ]]></tex-math></inline-formula>, then <inline-formula><tex-math id="math-69"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha < \alpha _ { 1 } < 1 \end{document} ]]></tex-math></inline-formula>. Therefore, (8) can be written as follows,</p><disp-formula id="equation-18"><tex-math id="math-70"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}\operatorname{RVaR}_{(\alpha,a^*)}(L)&=\max_{\alpha<\alpha_1<1}\operatorname{RVaR}_{(\alpha,a_1)}(L)\\&\quad\text{s.t. }k\operatorname{RCTV}_{(\alpha,a)}(L)-\operatorname{CTV}_{\alpha}(L)=0,\end{aligned}\tag{9}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-71"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k > 0 \end{document} ]]></tex-math></inline-formula>. To simplify the notations, we rewrite (9) as,</p><disp-formula id="equation-19"><tex-math id="math-72"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}\operatorname{RVaR}_{(\alpha,a^*)}(L)&=\max_{\alpha<\alpha_1<1}g(\alpha_1,k)\\&\quad\text{s.t. }h(\alpha_1,k)=0,\end{aligned}\tag{10}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-73"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle g ( \alpha _ { 1 } , k ) = \mathrm { R V a R } _ { ( \alpha , a ) } ( L ) , \ h ( \alpha _ { 1 } , k ) = k \mathrm { R C T V } _ { ( \alpha , a ) } ( L ) - \mathrm { C T V } _ { \alpha } ( L ) \end{document} ]]></tex-math></inline-formula>. Then, we apply the Lagrange multiplier method in <xref ref-type="bibr" rid="BIBR-22">[22]</xref> by defining a Lagrangian function,</p><disp-formula id="equation-20"><tex-math id="math-74"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathcal {L} = g (\alpha_ {1}, k) - \mu h (\alpha_ {1}, k). \end{document} ]]></tex-math></disp-formula><p>We estimate the values of <inline-formula><tex-math id="math-75"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-76"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-77"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula> and  by solving the following system of nonlinear equations,</p><disp-formula id="equation-21"><tex-math id="math-78"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle G (\mathbf {x}) = 0,\tag{11} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-79"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } = ( \alpha _ { 1 } , \mu , k ) ^ { \prime } \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-80"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle G ( \mathbf { x } ) = ( \partial \mathcal { L } / \partial \alpha _ { 1 } , \partial \mathcal { L } / \partial \mu , \partial \mathcal { L } / \partial k ) ^ { \prime } \end{document} ]]></tex-math></inline-formula>. In this article, we solve (11) in two ways, namely by using the Newton method and the spiral optimization (SpO) method. The Newton method is given by,</p><disp-formula id="equation-22"><tex-math id="math-81"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf {x} _ {t + 1} = \mathbf {x} _ {t} - J (\mathbf {x} _ {t}) ^ {- 1} G (\mathbf {x} _ {t}),\tag{12} \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-82"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J ( \mathbf { x } ) \end{document} ]]></tex-math></inline-formula> is a Jacobian matrix given by,</p><disp-formula id="equation-23"><tex-math id="math-83"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle J (\mathbf {x}) = \left( \begin{array}{c c c} \frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} ^ {2}} & \frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} \partial \mu} & \frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} \partial k} \\ \frac {\partial^ {2} \mathcal {L}}{\partial \mu \partial \alpha_ {1}} & \frac {\partial^ {2} \mathcal {L}}{\partial \mu^ {2}} & \frac {\partial^ {2} \mathcal {L}}{\partial \mu \partial k} \\ \frac {\partial^ {2} \mathcal {L}}{\partial k \partial \alpha_ {1}} & \frac {\partial^ {2} \mathcal {L}}{\partial k \partial \mu} & \frac {\partial^ {2} \mathcal {L}}{\partial k ^ {2}} \end{array} \right).\tag{13} \end{document} ]]></tex-math></disp-formula><p>The calculation of each element of the Jacobian matrix (13) is given in the Appendix.</p><p>To perform the SpO method for solving (11), we need to change the problem into a minimization problem by defining an objective function as follows,</p><disp-formula id="equation-24"><tex-math id="math-84"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H (\mathbf {x}) = G (\mathbf {x}) ^ {\prime} G (\mathbf {x}) = \left(\frac {\partial \mathcal {L}}{\partial \alpha_ {1}}\right) ^ {2} + \left(\frac {\partial \mathcal {L}}{\partial \mu}\right) ^ {2} + \left(\frac {\partial \mathcal {L}}{\partial k}\right) ^ {2}.\tag{14} \end{document} ]]></tex-math></disp-formula><p>SpO is a metaheuristic algorithm based on logarithmic spiral phenomena like whirling water currents, nautilus shells, and spiral galaxies. SpO spins a number of points <inline-formula><tex-math id="math-85"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { n } \end{document} ]]></tex-math></inline-formula> counterclockwise to a center point of rotation with a particular angle and radius scale. The center of rotation is the location where the objective function has the least value. In this article, our problem lies in <inline-formula><tex-math id="math-86"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 3 } \end{document} ]]></tex-math></inline-formula>, and hence the SpO method presented below is designed to solve the problem of minimization of <inline-formula><tex-math id="math-87"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H \end{document} ]]></tex-math></inline-formula> in (14) in <inline-formula><tex-math id="math-88"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbb { R } ^ { 3 } \end{document} ]]></tex-math></inline-formula>.</p><p>The minimization problem <inline-formula><tex-math id="math-89"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \min_{\mathbf{x}}H(\mathbf{x}) \end{document} ]]></tex-math></inline-formula> is equivalent to the constrained maximization of <inline-formula><tex-math id="math-90"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { R V a R } _ { \alpha , a } ( L ) \end{document} ]]></tex-math></inline-formula> because <inline-formula><tex-math id="math-91"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } ) = G ( \mathbf { x } ) ^ { \prime } G ( \mathbf { x } ) \end{document} ]]></tex-math></inline-formula> represents the squared norm of the KKT residuals of the original problem. Hence, minimizing <inline-formula><tex-math id="math-92"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } ) \end{document} ]]></tex-math></inline-formula> drives all firstorder optimality conditions <inline-formula><tex-math id="math-93"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \nabla { \mathcal { L } } = 0 \end{document} ]]></tex-math></inline-formula> to be satisfied, and any point where <inline-formula><tex-math id="math-94"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } ) = 0 \end{document} ]]></tex-math></inline-formula> corresponds to a stationary point of the Lagrangian of the maximization problem <inline-formula><tex-math id="math-95"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \max_{a}\operatorname{RVaR}_{\alpha,a}(L) \end{document} ]]></tex-math></inline-formula>.</p><p>Before processing the SpO method, in the initialization, write <inline-formula><tex-math id="math-96"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } = ( \alpha _ { 1 } , \mu , k ) \end{document} ]]></tex-math></inline-formula>, define the search space <inline-formula><tex-math id="math-97"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I \subset \mathbb { R } ^ { 3 } \end{document} ]]></tex-math></inline-formula>, set <inline-formula><tex-math id="math-98"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m \end{document} ]]></tex-math></inline-formula> to be the number of points where <inline-formula><tex-math id="math-99"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle m \geq 2 \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-100"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \omega \end{document} ]]></tex-math></inline-formula> to be the angle of rotation where <inline-formula><tex-math id="math-101"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < \omega \le \pi , r \end{document} ]]></tex-math></inline-formula> to be the rotation’s scaling radius where <inline-formula><tex-math id="math-102"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 0 < r < 1 \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-103"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t _ { \mathrm { m a x } } \end{document} ]]></tex-math></inline-formula> to be the iteration maximum number. As for the starting process, choose random numbers <inline-formula><tex-math id="math-104"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } _ { i } ( 0 ) \in I \end{document} ]]></tex-math></inline-formula> as the starting point, where <inline-formula><tex-math id="math-105"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i = 1 , 2 , \dots , m \end{document} ]]></tex-math></inline-formula>. Set <inline-formula><tex-math id="math-106"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } ^ { \mathrm { g b e s t } } ( 0 ) = \mathbf { x } ^ { \mathrm { g 0 } } \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-107"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } ^ { \mathrm { g 0 } } ) = \operatorname* { m i n } _ { i } H ( \mathbf { x } _ { i } ( 0 ) ) \end{document} ]]></tex-math></inline-formula> is the starting center of the rotation. Set <inline-formula><tex-math id="math-108"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t = 0 \end{document} ]]></tex-math></inline-formula>.</p><p>(1): Update the point position for each <inline-formula><tex-math id="math-109"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle i \: ( i = 1 , 2 , \dots , m ) ; \end{document} ]]></tex-math></inline-formula></p><disp-formula id="equation-25"><tex-math id="math-110"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf {x} _ {i} (t + 1) = S _ {3} (r, \omega) \mathbf {x} _ {i} (t) - (S _ {3} (r, \omega) - I _ {3}) \mathbf {x} ^ {\mathrm{gbest}} (t), \end{document} ]]></tex-math></disp-formula><p>where <inline-formula><tex-math id="math-111"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I _ { 3 } \end{document} ]]></tex-math></inline-formula> is the <inline-formula><tex-math id="math-112"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 3 \times 3 \end{document} ]]></tex-math></inline-formula> identity matrix, <inline-formula><tex-math id="math-113"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle S _ { 3 } ( r , \omega ) = r \Pi _ { i = 1 } ^ { 2 } \big ( \Pi _ { j = 1 } ^ { i } R _ { 3 - i , 4 - j } ^ { ( 3 ) } ( \omega ) \big ) \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-114"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle R _ { i , j } ^ { ( 3 ) } ( \omega ) \end{document} ]]></tex-math></inline-formula> is the plane rotation matrix acting on the <inline-formula><tex-math id="math-115"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ( i , j ) \end{document} ]]></tex-math></inline-formula>−coordinates, that is equal to the identity matrix except for the four entries: the <inline-formula><tex-math id="math-116"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ii \end{document} ]]></tex-math></inline-formula>th and <inline-formula><tex-math id="math-117"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle jj \end{document} ]]></tex-math></inline-formula>th entries are cos <inline-formula><tex-math id="math-118"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \omega \end{document} ]]></tex-math></inline-formula>, the <inline-formula><tex-math id="math-119"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ji \end{document} ]]></tex-math></inline-formula>th entry is sin <inline-formula><tex-math id="math-120"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \omega \end{document} ]]></tex-math></inline-formula>, and the <inline-formula><tex-math id="math-121"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle ij \end{document} ]]></tex-math></inline-formula>th entry is − sin <inline-formula><tex-math id="math-122"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \omega \end{document} ]]></tex-math></inline-formula>.</p><p>(2): Check to see if the updated position is still present in the search space: <inline-formula><tex-math id="math-123"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname { I f } \ \mathbf { x } _ { i } ( t + 1 ) \in I \end{document} ]]></tex-math></inline-formula>, then calculate <inline-formula><tex-math id="math-124"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } _ { i } ( t + 1 ) ) \end{document} ]]></tex-math></inline-formula>. <inline-formula><tex-math id="math-125"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname { I f } \ \mathbf { x } _ { i } ( t + 1 ) \ \not \in I \end{document} ]]></tex-math></inline-formula>, then set <inline-formula><tex-math id="math-126"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H(x_i(t+1)=\operatorname{NaN} \end{document} ]]></tex-math></inline-formula><xref ref-type="bibr" rid="BIBR-23">[23]</xref>.</p><p>(3): Update the rotation center: <inline-formula><tex-math id="math-127"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } ^ { \mathrm { g b e s t } } ( t { + } 1 ) = \mathbf { x } ^ { \mathrm { g } } \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-128"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H ( \mathbf { x } ^ { \mathrm { g } } ) = \operatorname* { m i n } _ { i } H ( \mathbf { x } _ { i } ( t + 1)) \end{document} ]]></tex-math></inline-formula>.</p><p>(4): If <inline-formula><tex-math id="math-129"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t < t _ { \mathrm { m a x } } \end{document} ]]></tex-math></inline-formula>, then redo the processes 1 until 3 with setting <inline-formula><tex-math id="math-130"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t = t + 1 \end{document} ]]></tex-math></inline-formula>. If <inline-formula><tex-math id="math-131"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle t = t _ { \mathrm { m a x } } \end{document} ]]></tex-math></inline-formula>, then stop the processes.</p><p>The output of the algorithm is <inline-formula><tex-math id="math-132"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathbf { x } ^ { \mathrm { g b e s t } } ( t _ { \mathrm { m a x } } ) \end{document} ]]></tex-math></inline-formula>, where the value of <inline-formula><tex-math id="math-133"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H [ \mathbf { x } ^ { \mathrm { g b e s t } } ( t _ { \mathrm { m a x } } ) ] \end{document} ]]></tex-math></inline-formula> is nearly zero. In our numerical experiment, we run the SpO method using the following algorithm settings: <inline-formula><tex-math id="math-134"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle I = ( \alpha , 1 ) \times ( 0 , 1 ) \times ( 1 0 , 1 0 0 0 ) \end{document} ]]></tex-math></inline-formula>, where <inline-formula><tex-math id="math-135"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 , m = 5000 \end{document} ]]></tex-math></inline-formula>, <inline-formula><tex-math id="math-136"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \omega = \pi / 4 , r = 0 . 9 5 , t _ { m a x } = 5 0 0 \end{document} ]]></tex-math></inline-formula>, while the number of runs is 20.</p><p>The following is an example of RVaR optimization with RCTV and CTV. More specifically, we construct RVaR for the exponential distribution. Application of this distribution encompasses a wide spectrum of fields, one of which is actuarial science.<target id="anchor-dd7bc323-31d6-4346-b8bf-7b638ed058e7" target-type="reference-target"/></p><p><bold>Example 4.1.</bold> Refer to Examples <xref ref-type="custom" custom-type="reference-target" rid="anchor-9ef498e6-0224-4d2f-adb3-2434b7103ef5">6.1</xref> and <xref ref-type="custom" custom-type="reference-target" rid="anchor-7c150fe8-5bec-4d0e-86eb-f1a2fdb964d8">6.2</xref> in the Appendix. Before performing the optimization, we compute the CTV of risk <inline-formula><tex-math id="math-137"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula>. The TVaR of <inline-formula><tex-math id="math-138"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> at probability level <inline-formula><tex-math id="math-139"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> is given by,</p><disp-formula id="equation-26"><tex-math id="math-140"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{TVaR} _ {\alpha} (L) = \frac {1}{\lambda} \big [ 1 - \ln (1 - \alpha) \big ]. \end{document} ]]></tex-math></disp-formula><p>While <inline-formula><tex-math id="math-141"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \textstyle \int _ { \alpha } ^ { 1 } { \bigl ( } Q _ { p } ( L ) { \bigr ) } ^ { 2 } \end{document} ]]></tex-math></inline-formula><inline-formula><tex-math id="math-142"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle dp \end{document} ]]></tex-math></inline-formula> can be calculated as follows,</p><disp-formula id="equation-27"><tex-math id="math-143"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \int_ {\alpha} ^ {1} \left(Q _ {p} (L)\right) ^ {2} \mathrm{d} p = \frac {1 - \alpha}{\lambda^ {2}} \big [ \ln^ {2} (1 - \alpha) - 2 \ln (1 - \alpha) + 2 \big ]. \end{document} ]]></tex-math></disp-formula><p>Hence,</p><disp-formula id="equation-28"><tex-math id="math-144"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{equation*}\begin{aligned}\operatorname{CTV}_{\alpha}(L)&=\frac{1}{1-\alpha}\int_{\alpha}^{1}(Q_p(L))^2\,dp-(\operatorname{TVaR}_{\alpha}(L))^2\\&=\frac{1}{\lambda^2}\left[\ln^2(1-\alpha)-2\ln(1-\alpha)+2\right]-\frac{1}{\lambda^2}\left[\ln^2(1-\alpha)-2\ln(1-\alpha)+1\right]\\&=\frac{1}{\lambda^2}.\end{aligned}\tag{15}\end{equation*} \end{document} ]]></tex-math></disp-formula><p>Based on <xref ref-type="disp-formula" rid="equation-2">(17)</xref> in p. <xref ref-type="custom" custom-type="reference-target" rid="anchor-2bdf688e-1054-487a-87e8-345908c0d655">15</xref> and (15), we may construct the following analytical formula,</p><disp-formula id="equation-29"><tex-math id="math-145"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle h \left(\alpha_ {1}, k\right) = k \operatorname{RCTV} _ {\left(\alpha , a\right)} (L) - \operatorname{CTV} _ {\alpha} (L) = k \left(\frac {1}{\lambda^ {2} \left(\alpha_ {1} - \alpha\right)} \Lambda_ {2} - \frac {1}{\lambda^ {2} \left(\alpha_ {1} - \alpha\right) ^ {2}} \Lambda_ {1} ^ {2}\right) - \frac {1}{\lambda^ {2}}, \end{document} ]]></tex-math></disp-formula><p>where</p><disp-formula id="equation-30"><tex-math id="math-146"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} \Lambda_ {1} = (1 - \alpha) \big (1 - \ln (1 - \alpha) \big) - (1 - \alpha_ {1}) \big (1 - \ln (1 - \alpha_ {1}) \big), \\ \Lambda_ {2} = (1 - \alpha) \Big (\ln^ {2} (1 - \alpha) - 2 \ln (1 - \alpha) + 2 \Big) - (1 - \alpha_ {1}) \Big (\ln^ {2} (1 - \alpha_ {1}) - 2 \ln (1 - \alpha_ {1}) + 2 \Big). \end{array} \end{document} ]]></tex-math></disp-formula><p>Furthermore, we may extract the Lagrangian multiplier, which is provided by,</p><disp-formula id="equation-31"><tex-math id="math-147"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathcal {L} = g (\alpha_ {1}, k) - \mu h (\alpha_ {1}, k) = \frac {1}{\lambda (\alpha_ {1} - \alpha)} \Lambda_ {1} - \frac {\mu k}{\lambda^ {2} (\alpha_ {1} - \alpha)} \Lambda_ {2} + \frac {\mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} ^ {2} + \frac {\mu}{\lambda^ {2}}. \end{document} ]]></tex-math></disp-formula><p>The firstand second-order partial derivatives are then calculated, as shown in the Appendix.</p></sec><sec id="sec-5"><title>5. APPLICATION</title><p>This research aims to examine the performance of the SpO and Newton methods on RVaR optimization. Our data comes from 2004 and 2005 one-year auto insurance policies<xref ref-type="fn" rid="fn-2">2</xref>; out of the 67,856 policies, 4,618 (6.8%) policies had at least one claim. Suppose the risk <inline-formula><tex-math id="math-148"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> is the claim amount.<xref ref-type="table" rid="table-1">Table 1 </xref>provides a statistical summary of the claim amount. It can be seen that the claim amount has positive skewness, which is 5.0470. Furthermore, the kurtosis of the claim amount is said to be significant when greater than 3. A kurtosis value above 3 (43.3102) indicates that, relative to the normal distribution, the probability of the observations tending to be far from the mean will be greater than the probability of observations tending to be close to the mean. The information in<xref ref-type="fig" rid="figure-1">Figure 1</xref>(a) supports this finding. Moreover, a box plot of the data in <xref ref-type="fig" rid="figure-1">Figure 1</xref>(b) indicates that the right tail contains 758 outliers. Take notice that every figure and calculation mentioned in this article is done using MATLAB programs.</p><table-wrap id="table-1"><label>Table 1</label><caption><p>Descriptive statistic of claim amount</p></caption><table><colgroup><col></col><col></col></colgroup><thead><tr><th scope="col">Statistic</th><th scope="col">Claim amount (<italic>L</italic>)</th></tr></thead><tbody><tr><td>Sample size</td><td>4,618</td></tr><tr><td>Mean</td><td><inline-formula><tex-math id="math-149"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 2.0131 \times 10^{3} \end{document} ]]></tex-math></inline-formula></td></tr><tr><td>Standard deviation</td><td><inline-formula><tex-math id="math-150"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle 3.5480 \times 10^{3} \end{document} ]]></tex-math></inline-formula></td></tr><tr><td>Skewness</td><td>5.0470</td></tr><tr><td>Kurtosis</td><td>43.3102</td></tr></tbody></table></table-wrap><fig id="figure-1"><label>Figure 1.</label><caption><p>(a) Histogram and (b) box plot of the claim amount.</p></caption><graphic xlink:href="https://jims-a.org/index.php/jimsa/article/download/1773/537/13840" mime-subtype="png" mimetype="image"><alt-text>Figure 1.</alt-text></graphic></fig><p>We find that <inline-formula><tex-math id="math-151"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> is one-parameter exponentially distributed by applying the maximum likelihood estimation (MLE) approach, where the parameter estimate is <inline-formula><tex-math id="math-152"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \hat { \lambda } = 1 / 2 0 1 3 . 0 9 \end{document} ]]></tex-math></inline-formula>. The significant number of outliers is probably going to have an impact on this estimate. We have in <xref ref-type="fig" rid="figure-2">Figure 2</xref> the comparison of five risk measures of <inline-formula><tex-math id="math-153"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula>. Recall that, the CTV of <inline-formula><tex-math id="math-154"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> is the same for all <inline-formula><tex-math id="math-155"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula>. On the other hand, the larger the <inline-formula><tex-math id="math-156"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> the smaller the RCTV. Moreover, RCTV is relatively much smaller than CTV. Note that RVaR is smaller than TVaR but larger than the quantile at the same probability level. It means that RVaR reduces the amount of TVaR.</p><fig id="figure-2"><label>Figure 2.</label><caption><p>Risk measures for the claim amount.</p></caption><graphic xlink:href="https://jims-a.org/index.php/jimsa/article/download/1773/537/13841" mime-subtype="jpeg" mimetype="image"><alt-text>Figure 2.</alt-text></graphic></fig><table-wrap id="table-2"><label>Table 2.</label><caption><p>Values of α1, μ, and k maximizing RVaR using SpO method, contraction parameter estimation, risk measures forecast, number and proportion of violations of the RVaR (α,0) forecasts.</p></caption><table><colgroup><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col></colgroup><thead><tr><th scope="col"><inline-formula><tex-math id="math-157"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula></th><th scope="col">sig. level</th><th scope="col">Trial</th><th scope="col"><inline-formula><tex-math id="math-158"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α₁ \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-159"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle μ \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-160"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-161"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-162"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-163"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle RVaR (α,α) \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-164"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle TVaR ₀.₉ \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-165"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle VaR ₀.₉ \end{document} ]]></tex-math></inline-formula></th><th scope="col">no. violations</th><th scope="col">prop. violationsᵃ</th><th scope="col">differenceᵇ</th></tr></thead><tbody><tr><td rowspan="5">0.9</td><td rowspan="5">0.1</td><td>1</td><td>0.9114</td><td>1.443 × 10⁻⁵</td><td>820.523</td><td>0.0051</td><td>0.9433</td><td>4,754.6</td><td rowspan="5">6,648.4</td><td rowspan="5">4,635.3</td><td>488</td><td>0.1057</td><td>0.0057</td></tr><tr><td>2</td><td>0.9110</td><td>1.392 × 10⁻⁵</td><td>836.691</td><td>0.0041</td><td>0.9587</td><td>4,750.3</td><td>489</td><td>0.1059</td><td>0.0059</td></tr><tr><td>3</td><td>0.9116</td><td>1.468 × 10⁻⁵</td><td>791.380</td><td>0.0057</td><td>0.9359</td><td>4,756.8</td><td>488</td><td>0.1057</td><td>0.0057</td></tr><tr><td>4</td><td>0.9116</td><td>1.468 × 10⁻⁵</td><td>791.379</td><td>0.0057</td><td>0.9359</td><td>4,756.8</td><td>488</td><td>0.1057</td><td>0.0057</td></tr><tr><td>5</td><td>0.9111</td><td>1.409 × 10⁻⁵</td><td>862.415</td><td>0.0044</td><td>0.9535</td><td>4,751.7</td><td>489</td><td>0.1059</td><td>0.0059</td></tr><tr><td rowspan="5">0.95</td><td rowspan="5">0.05</td><td>1</td><td>0.9554</td><td>1.370 × 10⁻⁵</td><td>913.964</td><td>0.0037</td><td>0.7420</td><td>6,143.8</td><td rowspan="5">8,043.8</td><td rowspan="5">6,030.7</td><td>358</td><td>0.0775</td><td>0.0275</td></tr><tr><td>2</td><td>0.9552</td><td>1.319 × 10⁻⁵</td><td>988.643</td><td>0.0029</td><td>0.7544</td><td>6,139.6</td><td>358</td><td>0.0775</td><td>0.0275</td></tr><tr><td>3</td><td>0.9557</td><td>1.443 × 10⁻⁵</td><td>820.490</td><td>0.0051</td><td>0.7250</td><td>6,150.0</td><td>358</td><td>0.0775</td><td>0.0275</td></tr><tr><td>4</td><td>0.9560</td><td>1.509 × 10⁻⁵</td><td>717.777</td><td>0.0067</td><td>0.7105</td><td>6,155.5</td><td>357</td><td>0.0775</td><td>0.0273</td></tr><tr><td>5</td><td>0.9554</td><td>1.368 × 10⁻⁵</td><td>916.729</td><td>0.0037</td><td>0.7425</td><td>6,143.7</td><td>358</td><td>0.0775</td><td>0.0275</td></tr><tr><td rowspan="5">0.98</td><td rowspan="5">0.02</td><td>1</td><td>0.9822</td><td>1.361 × 10⁻⁵</td><td>926.728</td><td>0.0035</td><td>0.5699</td><td>7,987.7</td><td rowspan="5">9,888.3</td><td rowspan="5">7,875.3</td><td>235</td><td>0.0509</td><td>0.0309</td></tr><tr><td>2</td><td>0.9831</td><td>1.969 × 10⁻⁵</td><td>427.175</td><td>0.0349</td><td>0.4775</td><td>8,039.4</td><td>235</td><td>0.0509</td><td>0.0309</td></tr><tr><td>3</td><td>0.9821</td><td>1.327 × 10⁻⁵</td><td>975.900</td><td>0.0030</td><td>0.5761</td><td>7,984.8</td><td>236</td><td>0.0511</td><td>0.0311</td></tr><tr><td>4</td><td>0.9821</td><td>1.319 × 10⁻⁵</td><td>988.912</td><td>0.0029</td><td>0.5777</td><td>7,984.1</td><td>237</td><td>0.0513</td><td>0.0313</td></tr><tr><td>5</td><td>0.9822</td><td>1.362 × 10⁻⁵</td><td>925.179</td><td>0.0036</td><td>0.5697</td><td>7,987.7</td><td>235</td><td>0.0509</td><td>0.0309</td></tr></tbody></table><table-wrap-foot><p>a. Prop.  violations is the proportion of violations to the total number of observations (4,618 observations). b. Difference is the absolute difference between prop.  violations and sig.  level.</p></table-wrap-foot></table-wrap><p>By utilizing the estimated parameter <inline-formula><tex-math id="math-166"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \hat { \lambda } \end{document} ]]></tex-math></inline-formula> derived from the data, we employ SpO and Newton methods to resolve the RVaR optimization problem (10). Using the SpO approach, the outcomes are found in <xref ref-type="table" rid="table-2">Table 2</xref>. The values of three variables <inline-formula><tex-math id="math-167"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } , \mu , \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-168"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula> that maximize RVaR (10) for three distinct <inline-formula><tex-math id="math-169"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 , 0 . 9 5 , 0 . 9 8 \end{document} ]]></tex-math></inline-formula> choices are shown in the <xref ref-type="table" rid="table-2">Table 2</xref>. For each case of <inline-formula><tex-math id="math-170"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \end{document} ]]></tex-math></inline-formula>, we run the SpO method in five trials. <xref ref-type="table" rid="table-2">Table 2</xref>column 6 shows that the values of the objective function <inline-formula><tex-math id="math-171"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H = H ( \alpha _ { 1 } , \mu , k ) \end{document} ]]></tex-math></inline-formula> are relatively near to zero which indicates that the method is quite successful for minimizing <inline-formula><tex-math id="math-172"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H \end{document} ]]></tex-math></inline-formula> in (14). The visualization example of <inline-formula><tex-math id="math-173"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H \end{document} ]]></tex-math></inline-formula> versus iterations for one trial with 20 runs is given in <xref ref-type="fig" rid="figure-3">Figure 3</xref>. Since <inline-formula><tex-math id="math-174"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle H \end{document} ]]></tex-math></inline-formula> is close to zero, we can say that the system of nonlinear equations (11) which consists of the first derivatives of the Lagrangian function <inline-formula><tex-math id="math-175"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathcal { L } \end{document} ]]></tex-math></inline-formula> has been solved. From the estimated value of <inline-formula><tex-math id="math-176"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } \end{document} ]]></tex-math></inline-formula>, we calculate the value of contraction parameter <inline-formula><tex-math id="math-177"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> to forecast <inline-formula><tex-math id="math-178"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { R V a R } _ { ( \alpha , a ) } \end{document} ]]></tex-math></inline-formula>. Another attractive result is that the RVaR forecasts gained from the optimization (column 9 in <xref ref-type="table" rid="table-2">Table 2</xref>) are comparatively significantly smaller than the TVaR forecast. This show that the relatively large TVaR forecast can be reduced by computing the RVaR forecast. Those relatively large TVaR forecasts, especially when compared to the VaR forecasts, are of course influenced by <inline-formula><tex-math id="math-179"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \hat { \lambda } \end{document} ]]></tex-math></inline-formula> which is also afected by the number of outliers, namely 758 observations.</p><p><xref ref-type="table" rid="table-2">Table 2</xref> presents the number of violations of the RVaR forecast using the SpO technique. It is the number of sample observations that are larger than the RVaR forecast and thus outside of the critical value. Then, by calculating the number of violations of the <inline-formula><tex-math id="math-180"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname { R V a R } _ { ( 0 . 9 , a ) } \end{document} ]]></tex-math></inline-formula>, we obtain the proportion of violations (prop. violations) of 0.1057 (there are 488 violations out of 4,618 observations, therefore 488/4,618=0.1057). <xref ref-type="table" rid="table-2">Table 2</xref> also displays the significance levels and proportions of violations for α = 0.95, 0.98. <xref ref-type="table" rid="table-2">Table 2</xref> shows that the probability level <inline-formula><tex-math id="math-181"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 \end{document} ]]></tex-math></inline-formula> results in the smallest diferences between the prop. violations and the significance level, 0.0057 and 0.0059, respectively. Therefore, in this case, the best RVaR forecast is obtained when <inline-formula><tex-math id="math-182"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 \end{document} ]]></tex-math></inline-formula>.</p><table-wrap id="table-3"><label>Table 3.</label><caption><p>Values of α1, μ, and k maximizing RVaR using Newton method, contraction parameter estimation, risk measures forecast, number and proportion of violations of the RVaR (α,0) forecasts.</p></caption><table><colgroup><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col><col></col></colgroup><thead><tr><th scope="col"><inline-formula><tex-math id="math-183"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \end{document} ]]></tex-math></inline-formula></th><th scope="col">sig. level</th><th scope="col" colspan="3">Initial guess</th><th scope="col"><inline-formula><tex-math id="math-184"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-185"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-186"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-187"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-188"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle RVaR_{(\alpha,\alpha)} \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-189"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle TVaR_{0.9} \end{document} ]]></tex-math></inline-formula></th><th scope="col"><inline-formula><tex-math id="math-190"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle VaR_{0.9} \end{document} ]]></tex-math></inline-formula></th><th scope="col">no. violations</th><th scope="col">prop. violationsᵃ</th><th scope="col">differenceᵇ</th></tr></thead><tbody><tr><td rowspan="7">0.9</td><td rowspan="7">0.1</td><td rowspan="4"><inline-formula><tex-math id="math-191"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.01 \end{document} ]]></tex-math></inline-formula></td><td rowspan="2"><inline-formula><tex-math id="math-192"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-193"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.95 \end{document} ]]></tex-math></inline-formula></td><td>0.9014</td><td><inline-formula><tex-math id="math-194"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -4.981\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>47,121</td><td>1.8140</td><td>4,649.8</td><td rowspan="7">6,648.4</td><td rowspan="7">4,635.3</td><td>500</td><td>0.1083</td><td>0.0083</td></tr><tr><td><inline-formula><tex-math id="math-195"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9059</td><td><inline-formula><tex-math id="math-196"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -3.620\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>4,657.2</td><td>1.2290</td><td>4,695.9</td><td>492</td><td>0.1065</td><td>0.0065</td></tr><tr><td rowspan="2"><inline-formula><tex-math id="math-197"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-198"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.95 \end{document} ]]></tex-math></inline-formula></td><td>0.9016</td><td><inline-formula><tex-math id="math-199"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -6.845\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>38,097</td><td>1.7981</td><td>4,651.4</td><td>500</td><td>0.1083</td><td>0.0083</td></tr><tr><td><inline-formula><tex-math id="math-200"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9102</td><td><inline-formula><tex-math id="math-201"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -1.932\times10^{-8} \end{document} ]]></tex-math></inline-formula></td><td>854,560</td><td>0.9921</td><td>4,741.5</td><td>490</td><td>0.1061</td><td>0.0061</td></tr><tr><td rowspan="3"><inline-formula><tex-math id="math-202"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.001 \end{document} ]]></tex-math></inline-formula></td><td rowspan="2"><inline-formula><tex-math id="math-203"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-204"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.95 \end{document} ]]></tex-math></inline-formula></td><td>0.9015</td><td><inline-formula><tex-math id="math-205"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -5.726\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>42,927</td><td>1.8239</td><td>4,650.5</td><td>500</td><td>0.1083</td><td>0.0083</td></tr><tr><td><inline-formula><tex-math id="math-206"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9049</td><td><inline-formula><tex-math id="math-207"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -2.097\times10^{-9} \end{document} ]]></tex-math></inline-formula></td><td>3,838.5</td><td>1.3068</td><td>4,685.8</td><td>494</td><td>0.1070</td><td>0.0070</td></tr><tr><td><inline-formula><tex-math id="math-208"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-209"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.95 \end{document} ]]></tex-math></inline-formula></td><td>0.9015</td><td><inline-formula><tex-math id="math-210"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -5.923\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>41,967</td><td>1.8191</td><td>4,650.7</td><td>500</td><td>0.1083</td><td>0.0083</td></tr><tr><td rowspan="8">0.95</td><td rowspan="8">0.05</td><td rowspan="4"><inline-formula><tex-math id="math-211"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.01 \end{document} ]]></tex-math></inline-formula></td><td rowspan="2"><inline-formula><tex-math id="math-212"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-213"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.98 \end{document} ]]></tex-math></inline-formula></td><td>0.9510</td><td><inline-formula><tex-math id="math-214"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -1.116\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>24,180</td><td>1.3069</td><td>6,050.9</td><td rowspan="8">8,043.8 9</td><td rowspan="8">6,030.7</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td><inline-formula><tex-math id="math-215"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9518</td><td><inline-formula><tex-math id="math-216"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -6.846\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>7,168.4</td><td>1.1066</td><td>6,067.7</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td rowspan="2"><inline-formula><tex-math id="math-217"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-218"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.98 \end{document} ]]></tex-math></inline-formula></td><td>0.9511</td><td><inline-formula><tex-math id="math-219"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -1.670\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>18,465</td><td>1.2623</td><td>6,053.8</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td><inline-formula><tex-math id="math-220"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9529</td><td><inline-formula><tex-math id="math-221"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -2.835\times10^{-9} \end{document} ]]></tex-math></inline-formula></td><td>2,755.6</td><td>0.9506</td><td>6,090.2</td><td>364</td><td>0.0788</td><td>0.0288</td></tr><tr><td rowspan="4"><inline-formula><tex-math id="math-222"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.001 \end{document} ]]></tex-math></inline-formula></td><td rowspan="2"><inline-formula><tex-math id="math-223"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-224"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.98 \end{document} ]]></tex-math></inline-formula></td><td>0.9511</td><td><inline-formula><tex-math id="math-225"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -1.321\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>21,603</td><td>1.2882</td><td>6,052.1</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td><inline-formula><tex-math id="math-226"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9517</td><td><inline-formula><tex-math id="math-227"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -5.176\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>8,648.7</td><td>1.1374</td><td>6,061.4</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td rowspan="2"><inline-formula><tex-math id="math-228"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-229"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.98 \end{document} ]]></tex-math></inline-formula></td><td>0.9510</td><td><inline-formula><tex-math id="math-230"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -1.242\times10^{-10} \end{document} ]]></tex-math></inline-formula></td><td>22,513</td><td>1.2950</td><td>6,051.6</td><td>366</td><td>0.0793</td><td>0.0293</td></tr><tr><td><inline-formula><tex-math id="math-231"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9532</td><td><inline-formula><tex-math id="math-232"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -3.625\times10^{-9} \end{document} ]]></tex-math></inline-formula></td><td>2,322.4</td><td>0.9228</td><td>6,095.5</td><td>364</td><td>0.0788</td><td>0.0288</td></tr><tr><td rowspan="4">0.98</td><td rowspan="4">0.02</td><td rowspan="2"><inline-formula><tex-math id="math-233"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.01 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-234"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-235"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9803</td><td><inline-formula><tex-math id="math-236"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -3.627\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>44,675</td><td>1.0786</td><td>7,890.1</td><td rowspan="4">9,888.3</td><td rowspan="4">7,875.3</td><td>238</td><td>0.0515</td><td>0.0315</td></tr><tr><td><inline-formula><tex-math id="math-237"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-238"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9803</td><td><inline-formula><tex-math id="math-239"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -4.261\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>40,113</td><td>1.0619</td><td>7,891.0</td><td>238</td><td>0.0515</td><td>0.0315</td></tr><tr><td rowspan="2"><inline-formula><tex-math id="math-240"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0.001 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-241"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 10 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-242"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9803</td><td><inline-formula><tex-math id="math-243"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle -3.902\times10^{-11} \end{document} ]]></tex-math></inline-formula></td><td>42,546</td><td>1.0724</td><td>7,890.5</td><td>238</td><td>0.0515</td><td>0.0315</td></tr><tr><td><inline-formula><tex-math id="math-244"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k = 100 \end{document} ]]></tex-math></inline-formula></td><td><inline-formula><tex-math id="math-245"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha_1 = 0.99 \end{document} ]]></tex-math></inline-formula></td><td>0.9803</td><td></td><td>42,842</td><td>1.0733</td><td>7,890.4</td><td>238</td><td>0.0515</td><td>0.0315</td></tr></tbody></table><table-wrap-foot><p>a. Prop.  violations is the proportion of violations to the total number of observations (4,618 observations). b. Difference is the absolute difference between prop.  violations and sig.  level</p></table-wrap-foot></table-wrap><p>Furthermore, <xref ref-type="table" rid="table-3">Table 3</xref> shows the findings for the Newton approach (12). The table displays the values of <inline-formula><tex-math id="math-246"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm { t h r e e ~ v a r i a b l e s ~ } \alpha _ { 1 } , \mu , \end{document} ]]></tex-math></inline-formula> and <inline-formula><tex-math id="math-247"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula> that maximize RVaR (10) for three diferent chosen <inline-formula><tex-math id="math-248"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 , 0 . 9 5 , 0 . 9 8 \end{document} ]]></tex-math></inline-formula> We run the Newton method for a number of combinations of initial guesses: <inline-formula><tex-math id="math-249"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mu = 0 . 0 1 , 0 . 0 0 1 , k = 1 0 , 1 0 0 \end{document} ]]></tex-math></inline-formula>, and <inline-formula><tex-math id="math-250"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } = 0 . 9 5 , 0 . 9 8 , 0 . 9 9 \end{document} ]]></tex-math></inline-formula>. From the table, we can see that the obtained values of <inline-formula><tex-math id="math-251"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } \end{document} ]]></tex-math></inline-formula> are similar to the results of the SpO method for each diferent case of <inline-formula><tex-math id="math-252"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula>. In addition, the running time of the Newton method is far less consuming than that of the SpO method because the Newton method is a non-stochastic algorithm, and hence it is very fast. Moreover, from <xref ref-type="table" rid="table-3">Table 3</xref>, we can notice that the RVaR forecasts are less than those in <xref ref-type="table" rid="table-2">Table 2</xref> at the same probability levels. The comparison between RVaR forecasts using SpO and Newton methods for diferent cases of <inline-formula><tex-math id="math-253"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle α \end{document} ]]></tex-math></inline-formula> is visualized in <xref ref-type="fig" rid="figure-4">Figure 4</xref>.</p><fig id="figure-3"><label>Figure 3.</label><caption><p>Objective  function H  of  the  SpO  method over iteration.</p></caption><graphic xlink:href="https://jims-a.org/index.php/jimsa/article/download/1773/537/13842" mime-subtype="jpeg" mimetype="image"><alt-text>Figure 3.</alt-text></graphic></fig><p>Moreover, the number of violations of the RVaR forecast using the Newton method is also presented in <xref ref-type="table" rid="table-3">Table 3</xref>. Similar to the results in <xref ref-type="table" rid="table-2">Table 2</xref>, the probability level <inline-formula><tex-math id="math-254"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 \end{document} ]]></tex-math></inline-formula> in <xref ref-type="table" rid="table-3">Table 3</xref> results in the smallest diferences between the prop. violations and the significance level. Therefore, for the SpO method, the best RVaR forecast is obtained when <inline-formula><tex-math id="math-255"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha = 0 . 9 \end{document} ]]></tex-math></inline-formula>. Surprisingly, we find the fact that the prop. violations for the SpO method are always smaller than those of the Newton method. In other words, the Newton method underestimates RVaR. That is, in spite of the fact that the Newton method is very fast, the SpO method is more appropriate for forecasting RVaR.</p></sec><sec id="sec-6"><title>6. CONCLUDING REMARKS</title><p>This article presents an optimization approach for a generalized tail value-atrisk known as range value-at-risk (RVaR), by implementing Newton method and SpO method. The notion of the constraint function is to compare the second conditional central moment related to RVaR, known as RCTV, with the counterpart second conditional central moment connected to TVaR, known as CTV. We recog nize that RCTV must be less than CTV, therefore we multiply RCTV by a positive multiplier <inline-formula><tex-math id="math-256"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula> to create a new measure proportionate to CTV.</p><p>In the case of exponentially distributed risk, we demonstrate numerical findings for contraction parameter <inline-formula><tex-math id="math-257"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle a \end{document} ]]></tex-math></inline-formula> and multiplier <inline-formula><tex-math id="math-258"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle k \end{document} ]]></tex-math></inline-formula> using Newton and SpO methods. We gain that our objective function utilizing the SpO method converges to zero as the iteration increases, which implies that SpO is very appropriate for RVaR optimization. Moreover, the RVaR forecasts of the vehicle insurance claim amount obtained through optimization lower the magnitude of TVaR. This indicates that using the suggested RVaR optimization strategy will prevent unnecessary additional capital allocation while having no efect on the risk management policies imposed by regulators. However, the SpO method is more appropriate in forecasting RVaR since the diferences between the proportion of violations and the corresponding significance level are lower than those of the Newton method. Thus, the suggested optimization method is efective in the risk management of insurance claims and beneficial for actuaries in insurance companies.</p><fig id="figure-4"><label>Figure 4.</label><caption><p>Comparison  between  RVaR  forecasts  obtained from SpO method (straight-star line) and Newton method (straight-plus line) for different cases of α</p></caption><graphic xlink:href="https://jims-a.org/index.php/jimsa/article/download/1773/537/13843" mime-subtype="jpeg" mimetype="image"><alt-text>Figure 4.</alt-text></graphic></fig><p>However, the data has a significant number of outliers (16.41%), so our study suggests that there should be a necessity to consider most of the worst-case observations that exceed VaR in order to forecast the actual risk of the claim amount. The number of outliers that appear in the data should be accommodated with heavy-tailed distributions, such as Pareto, Weibull, and Burr. In the next research, we will apply RVaR optimization to the vehicle insurance data using the suggested heavy-tailed distributions.</p></sec><sec id="sec-7"><title>Appendix</title><p>In the following calculations, for reducing long-expression equation, we write</p><disp-formula id="equation-32"><tex-math id="math-259"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{l} \Lambda_ {1} = (1 - \alpha) \big (1 - \ln (1 - \alpha) \big) - (1 - \alpha_ {1}) \big (1 - \ln (1 - \alpha_ {1}) \big), \\ \Lambda_ {2} = (1 - \alpha) \Big (\ln^ {2} (1 - \alpha) - 2 \ln (1 - \alpha) + 2 \Big) - (1 - \alpha_ {1}) \Big (\ln^ {2} (1 - \alpha_ {1}) - 2 \ln (1 - \alpha_ {1}) + 2 \Big), \\ \Lambda_ {3} = \frac {1 - \alpha}{1 - \alpha_ {1}} \big (1 - \ln (1 - \alpha) \big) + \ln (1 - \alpha_ {1}) + \ln^ {2} (1 - \alpha_ {1}) - 1. \end{array} \end{document} ]]></tex-math></disp-formula><p><target id="anchor-9ef498e6-0224-4d2f-adb3-2434b7103ef5" target-type="reference-target"/></p><p><bold>Example 6.1</bold> (Forecast of RVaR of exponential risk). Assume that <inline-formula><tex-math id="math-260"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> represents a risk with an exponential distribution and parameter <inline-formula><tex-math id="math-261"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \lambda \end{document} ]]></tex-math></inline-formula>. The distribution function, probability function,VaR, and TVaR of <inline-formula><tex-math id="math-262"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> are as follows,</p><disp-formula id="equation-33"><tex-math id="math-263"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-34"><tex-math id="math-264"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{align*}F_L(l) &= 1 - e^{-\lambda l}, \quad f_L(l) = \lambda e^{-\lambda l}, \\Q_{\alpha}(L) &= -\frac{1}{\lambda} \ln(1 - \alpha), \quad \text{TVaR}_{\alpha}(L) = \frac{1}{\lambda} [1 - \ln(1 - \alpha)].\end{align*} \end{document} ]]></tex-math></disp-formula><p>Then, by remembering that <inline-formula><tex-math id="math-265"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha _ { 1 } - \alpha = ( 1 - \alpha ) ^ { a + 1 } \end{document} ]]></tex-math></inline-formula>, RVaR of <inline-formula><tex-math id="math-266"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle L \end{document} ]]></tex-math></inline-formula> at level <inline-formula><tex-math id="math-267"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \alpha \left( 0 < \alpha < 1 \right) \end{document} ]]></tex-math></inline-formula> is given by,</p><disp-formula id="equation-35"><tex-math id="math-268"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathrm{RVaR} _ {(\alpha , a)} (L) = \frac {1}{\lambda (1 - \alpha) ^ {a + 1}} \Lambda_ {1} = \frac {1}{\lambda (\alpha_ {1} - \alpha)} \Lambda_ {1}.\tag{16} \end{document} ]]></tex-math></disp-formula><p><target id="anchor-7c150fe8-5bec-4d0e-86eb-f1a2fdb964d8" target-type="reference-target"/></p><p><bold>Example 6.2.</bold> Consider the previous Example <xref ref-type="custom" custom-type="reference-target" rid="anchor-9ef498e6-0224-4d2f-adb3-2434b7103ef5">6.1</xref>. When calculating RCTV, keep in mind that,</p><disp-formula id="equation-36"><tex-math id="math-269"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{align*}\frac{1}{(1 - \alpha)^{1+a}} \int_{\alpha}^{\alpha_1} (Q_p(L))^2 \, \mathrm{d}p&= \frac{1}{(1 - \alpha)^{1+a}} \left( \int_{\alpha}^{1} (Q_p(L))^2 \, \mathrm{d}p - \int_{\alpha_1}^{1} (Q_p(L))^2 \, \mathrm{d}p \right) \\&= \frac{1}{\lambda^2 (1 - \alpha)^{1+a}} \Lambda_2.\end{align*} \end{document} ]]></tex-math></disp-formula><disp-formula id="equation-37"><tex-math id="math-270"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \\ \end{document} ]]></tex-math></disp-formula><p>Therefore,</p><disp-formula id="equation-38"><tex-math id="math-271"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \operatorname{RCTV} _ {(\alpha , a)} (L) = \frac {1}{\lambda^ {2} (1 - \alpha) ^ {1 + a}} \Lambda_ {2} - \frac {1}{\lambda^ {2} (1 - \alpha) ^ {2 a + 2}} \Lambda_ {1} ^ {2} = \frac {1}{\lambda^ {2} (\alpha_ {1} - \alpha)} \Lambda_ {2} - \frac {1}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} ^ {2}. \tag {17} \end{document} ]]></tex-math></disp-formula><p><target id="anchor-2bdf688e-1054-487a-87e8-345908c0d655" target-type="reference-target"/></p><p><bold>Partial derivatives. </bold>The following are the first and second-order partial derivatives of <inline-formula><tex-math id="math-272"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \mathcal{L} \end{document} ]]></tex-math></inline-formula>.</p><disp-formula id="equation-39"><tex-math id="math-273"><![CDATA[ \documentclass{article} \usepackage{amsmath} \begin{document} \displaystyle \begin{array}{r l} & {\frac {\partial \mathcal {L}}{\partial \alpha_ {1}} = \frac {\lambda - 2 (\mu k) \ln (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} - \frac {2 \mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {3}} \Lambda_ {1} ^ {2} + \frac {\mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {2}} \\ & {\qquad - \frac {\lambda \ln (1 - \alpha_ {1}) + (\mu k) \ln^ {2} (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha)},} \\ & {\frac {\partial \mathcal {L}}{\partial \mu} = \frac {k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} ^ {2} - \frac {k}{\lambda^ {2} (\alpha_ {1} - \alpha)} \Lambda_ {2} + \frac {1}{\lambda^ {2}},} \\ & {\frac {\partial \mathcal {L}}{\partial k} = \frac {\mu}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} ^ {2} - \frac {\mu}{\lambda^ {2} (\alpha_ {1} - \alpha)} \Lambda_ {2},} \\ & {\frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} ^ {2}} = \frac {2 \lambda + 8 \mu k \ln (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {3}} \Lambda_ {1} + \frac {6 \mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {4}} \Lambda_ {1} ^ {2} - \frac {2 \mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {3}} \Lambda_ {2} + \frac {2 \mu k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {3}} \\ & {\qquad + \frac {2 \lambda \ln (1 - \alpha_ {1}) + 2 \mu k \ln^ {2} (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} + \frac {\lambda + 2 \mu k \ln (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) (1 - \alpha_ {1})},} \\ & {\frac {\partial^ {2} \mathcal {L}}{\partial \mu \partial \alpha_ {1}} = \frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} \partial \mu} = - \frac {2 k \ln (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} - \frac {2 k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {3}} \Lambda_ {1} ^ {2} + \frac {k}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {2} - \frac {k \ln^ {2} (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha)},} \\ & {\frac {\partial^ {2} \mathcal {L}}{\partial k \partial \alpha_ {1}} = \frac {\partial^ {2} \mathcal {L}}{\partial \alpha_ {1} \partial k} = - \frac {2 \mu \ln (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} - \frac {2 \mu}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {3}} \Lambda_ {1} ^ {2} + \frac {\mu}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {2} - \frac {\mu \ln^ {2} (1 - \alpha_ {1})}{\lambda^ {2} (\alpha_ {1} - \alpha)},} \\ & {\frac {\partial^ {2} \mathcal {L}}{\partial k \partial \mu} = \frac {\partial^ {2} \mathcal {L}}{\partial \mu \partial k} = \frac {1}{\lambda^ {2} (\alpha_ {1} - \alpha) ^ {2}} \Lambda_ {1} ^ {2} - \frac {1}{\lambda^ {2} (\alpha_ {1} - \alpha)} \Lambda_ {2},} \\ & {\frac {\partial^ {2} \mathcal {L}}{\partial \mu^ {2}} = \frac {\partial^ {2} \mathcal {L}}{\partial k ^ {2}} = 0.} \end{array} \end{document} ]]></tex-math></disp-formula></sec></body><back><ack><title>Acknowledgement</title><p>We would like to thank the reviewers for their comments and suggestions.</p></ack><ref-list><title>REFERENCES</title><ref id="BIBR-1"><element-citation publication-type="journal"><article-title>Mixed value-at-risk and its numerical investigation</article-title><source>Physica A: Statistical Mechanics and its Applications</source><volume>541</volume><person-group person-group-type="author"><name><surname>Goel</surname><given-names>A.</given-names></name><name><surname>Sharma</surname><given-names>A.</given-names></name></person-group><year>2020</year><page-range>123524,</page-range><pub-id pub-id-type="doi">10.1016/j.physa.2019.123524</pub-id></element-citation></ref><ref id="BIBR-2"><element-citation publication-type="journal"><article-title>Coherent measures of risk</article-title><source>Mathematical finance</source><volume>9</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Artzner</surname><given-names>P.</given-names></name><name><surname>Delbaen</surname><given-names>F.</given-names></name><name><surname>Eber</surname><given-names>J.-M.</given-names></name><name><surname>Heath</surname><given-names>D.</given-names></name></person-group><year>1999</year><page-range>203-228,</page-range><pub-id pub-id-type="doi">10.1111/1467-9965.00068</pub-id></element-citation></ref><ref id="BIBR-3"><element-citation publication-type="journal"><article-title>Statistics and quantitative risk management for banking and insurance</article-title><source>Annual Review of Statistics and Its Application</source><volume>1</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Embrechts</surname><given-names>P.</given-names></name><name><surname>Hofert</surname><given-names>M.</given-names></name></person-group><year>2014</year><page-range>493-514,</page-range><pub-id pub-id-type="doi">10.1146/annurev-statistics-022513-115631</pub-id></element-citation></ref><ref id="BIBR-4"><element-citation publication-type="journal"><article-title>Modified expected shortfall: a new robust coherent risk measure</article-title><source>The Journal of Risk</source><volume>16</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Jadhav</surname><given-names>D.</given-names></name><name><surname>Ramanathan</surname><given-names>T.V.</given-names></name><name><surname>Naik-Nimbalkar</surname><given-names>U.</given-names></name></person-group><year>2013</year><page-range>69,</page-range><pub-id pub-id-type="doi">10.21314/JOR.2013.269</pub-id></element-citation></ref><ref id="BIBR-5"><element-citation publication-type="journal"><article-title>Worst-case range value-at-risk with partial information</article-title><source>SIAM Journal on Financial Mathematics</source><volume>9</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Li</surname><given-names>L.</given-names></name><name><surname>Shao</surname><given-names>H.</given-names></name><name><surname>Wang</surname><given-names>R.</given-names></name><name><surname>Yang</surname><given-names>J.</given-names></name></person-group><year>2018</year><page-range>190-218,</page-range><pub-id pub-id-type="doi">10.1137/17M1126138</pub-id></element-citation></ref><ref id="BIBR-6"><element-citation publication-type="journal"><article-title>On pareto-optimal reinsurance with constraints under distortion risk measures</article-title><source>European Actuarial Journal</source><volume>8</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Jiang</surname><given-names>W.</given-names></name><name><surname>Hong</surname><given-names>H.</given-names></name><name><surname>Ren</surname><given-names>J.</given-names></name></person-group><year>2018</year><page-range>215-243,</page-range><pub-id pub-id-type="doi">10.2139/ssrn.2955764</pub-id></element-citation></ref><ref id="BIBR-7"><element-citation publication-type="journal"><article-title>Characterizing optimal allocations in quantile-based risk sharing</article-title><source>Insurance: Mathematics and Economics</source><volume>93</volume><person-group person-group-type="author"><name><surname>Wang</surname><given-names>R.</given-names></name><name><surname>Wei</surname><given-names>Y.</given-names></name></person-group><year>2020</year><page-range>288-300,</page-range><pub-id pub-id-type="doi">10.1016/j.insmatheco.2020.06.001</pub-id></element-citation></ref><ref id="BIBR-8"><element-citation publication-type="journal"><article-title>On the elicitability of range value at risk</article-title><source>Statistics &amp; risk modeling</source><volume>38</volume><issue>1-2</issue><person-group person-group-type="author"><name><surname>Fissler</surname><given-names>T.</given-names></name><name><surname>Ziegel</surname><given-names>J.F.</given-names></name></person-group><year>2021</year><page-range>25-46,</page-range><pub-id pub-id-type="doi">10.1515/strm-2020-0037</pub-id></element-citation></ref><ref id="BIBR-9"><element-citation publication-type="journal"><article-title>Range value-at-risk bounds for unimodal distributions under partial information</article-title><source>Insurance: Mathematics and Economics</source><volume>94</volume><person-group person-group-type="author"><name><surname>Bernard</surname><given-names>C.</given-names></name><name><surname>Kazzi</surname><given-names>R.</given-names></name><name><surname>Vandufel</surname><given-names>S.</given-names></name></person-group><year>2020</year><page-range>9-24,</page-range><pub-id pub-id-type="doi">10.1016/j.insmatheco.2020.05.013</pub-id></element-citation></ref><ref id="BIBR-10"><element-citation publication-type="journal"><article-title>Tail variance premium with applications for elliptical portfolio of risks</article-title><source>ASTIN Bulletin: The Journal of the IAA</source><volume>36</volume><issue>2</issue><person-group person-group-type="author"><name><surname>Furman</surname><given-names>E.</given-names></name><name><surname>Landsman</surname><given-names>Z.</given-names></name></person-group><year>2006</year><page-range>433-462,</page-range><pub-id pub-id-type="doi">10.2143/AST.36.2.2017929</pub-id></element-citation></ref><ref id="BIBR-11"><element-citation publication-type="journal"><article-title>A residual smoothing strategy for accelerating newton method continuation</article-title><source>Computers &amp; Fluids</source><volume>220</volume><person-group person-group-type="author"><name><surname>Mavriplis</surname><given-names>D.J.</given-names></name></person-group><year>2021</year><page-range>104859,</page-range><pub-id pub-id-type="doi">10.1016/j.compfluid.2021.104859</pub-id></element-citation></ref><ref id="BIBR-12"><element-citation publication-type="journal"><article-title>Convergent newton method and neural network for the electric energy usage prediction</article-title><source>Information Sciences</source><volume>585</volume><person-group person-group-type="author"><string-name>J. de Jes ́us Rubio, M. A. Islas, G. Ochoa, D. R. Cruz, E. Garcia, and J. Pacheco</string-name></person-group><year>2022</year><page-range>89-112,</page-range><pub-id pub-id-type="doi">10.1016/j.ins.2021.11.038</pub-id></element-citation></ref><ref id="BIBR-13"><element-citation publication-type="journal"><article-title>An optimal and low computational cost fractional newton-type method for solving nonlinear equations</article-title><source>Applied Mathematics Letters</source><volume>124</volume><person-group person-group-type="author"><name><surname>Candelario</surname><given-names>G.</given-names></name><name><surname>Cordero</surname><given-names>A.</given-names></name><name><surname>Torregrosa</surname><given-names>J.R.</given-names></name><name><surname>Vassileva</surname><given-names>M.P.</given-names></name></person-group><year>2022</year><page-range>107650,</page-range><pub-id pub-id-type="doi">10.1016/j.aml.2021.107650</pub-id></element-citation></ref><ref id="BIBR-14"><element-citation publication-type="journal"><article-title>Distributed adaptive newton methods with global superlinear convergence</article-title><source>Automatica</source><volume>138</volume><person-group person-group-type="author"><string-name>J. Zhang, K. You, and T. Ba ̧sar</string-name></person-group><year>2022</year><page-range>110156,</page-range><pub-id pub-id-type="doi">10.1016/j.automatica.2021.110156</pub-id></element-citation></ref><ref id="BIBR-15"><element-citation publication-type="journal"><article-title>Spiral dynamics inspired optimization</article-title><source>Journal of Advanced Computational Intelligence and Intelligent Informatics</source><volume>15</volume><issue>8</issue><person-group person-group-type="author"><name><surname>Tamura</surname><given-names>K.</given-names></name><name><surname>Yasuda</surname><given-names>K.</given-names></name></person-group><year>2011</year><page-range>1116-1122,</page-range><pub-id pub-id-type="doi">10.20965/jaciii.2011.p1116</pub-id></element-citation></ref><ref id="BIBR-16"><element-citation publication-type="journal"><article-title>Spiral optimization algorithm for solving combined economic and emission dispatch</article-title><source>International Journal of Electrical Power &amp; Energy Systems</source><volume>62</volume><person-group person-group-type="author"><name><surname>Benasla</surname><given-names>L.</given-names></name><name><surname>Belmadani</surname><given-names>A.</given-names></name><name><surname>Rahli</surname><given-names>M.</given-names></name></person-group><year>2014</year><page-range>163-174,</page-range><pub-id pub-id-type="doi">10.1016/j.ijepes.2014.04.037</pub-id></element-citation></ref><ref id="BIBR-17"><element-citation publication-type="journal"><article-title>Finding all solutions of systems of nonlinear equations using spiral dynamics inspired optimization with clustering</article-title><source>Journal of Advanced Computational Intelligence and Intelligent Informatics</source><volume>19</volume><issue>5</issue><person-group person-group-type="author"><name><surname>Sidarto</surname><given-names>K.A.</given-names></name><name><surname>Kania</surname><given-names>A.</given-names></name></person-group><year>2015</year><page-range>697-707,</page-range><pub-id pub-id-type="doi">10.20965/jaciii.2015.p0697</pub-id></element-citation></ref><ref id="BIBR-18"><element-citation publication-type="journal"><article-title>Model of deposit and loan of a bank using spiral optimization algorithm</article-title><source>Journal of the Indonesian Mathematical Society</source><volume>25</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Ansori</surname><given-names>M.F.</given-names></name><name><surname>Sidarto</surname><given-names>K.A.</given-names></name><name><surname>Sumarti</surname><given-names>N.</given-names></name></person-group><year>2019</year><page-range>292-301,</page-range><pub-id pub-id-type="doi">10.22342/jims.25.3.826.292-301</pub-id></element-citation></ref><ref id="BIBR-19"><element-citation publication-type="journal"><article-title>A novel multi-objective spiral optimization algorithm for an innovative solar/biomass-based multi-generation energy system: 3e analyses, and optimization algorithms comparison</article-title><source>Energy Conversion and Management</source><volume>219</volume><person-group person-group-type="author"><name><surname>Cao</surname><given-names>Y.</given-names></name><name><surname>Rad</surname><given-names>H.N.</given-names></name><name><surname>Jamali</surname><given-names>D.H.</given-names></name><name><surname>Hashemian</surname><given-names>N.</given-names></name><name><surname>Ghasemi</surname><given-names>A.</given-names></name></person-group><year>2020</year><page-range>112961,</page-range><pub-id pub-id-type="doi">10.1016/j.enconman.2020.112961</pub-id></element-citation></ref><ref id="BIBR-20"><element-citation publication-type="journal"><article-title>On optimization of copula-based extended tail value-at-risk and its application in energy risk</article-title><source>IEEE Access</source><volume>9</volume><person-group person-group-type="author"><name><surname>Josaphat</surname><given-names>B.P.</given-names></name><name><surname>Ansori</surname><given-names>M.F.</given-names></name><name><surname>Syuhada</surname><given-names>K.</given-names></name></person-group><year>2021</year><page-range>122474-122485,</page-range><pub-id pub-id-type="doi">10.1109/ACCESS.2021.3106715</pub-id></element-citation></ref><ref id="BIBR-21"><element-citation publication-type="journal"><article-title>Tail conditional variance for elliptically contoured distributions</article-title><source>Belgian Actuarial Bulletin</source><volume>5</volume><issue>1</issue><person-group person-group-type="author"><name><surname>Valdez</surname><given-names>E.A.</given-names></name></person-group><year>2005</year><page-range>26-36,</page-range><pub-id pub-id-type="doi">10.21314/JOR.2000.038</pub-id></element-citation></ref><ref id="BIBR-22"><element-citation publication-type="book"><article-title>Numerical optimization</article-title><person-group person-group-type="author"><name><surname>Nocedal</surname><given-names>J.</given-names></name><name><surname>Wright</surname><given-names>S.J.</given-names></name></person-group><year>2006</year><publisher-name>Springer</publisher-name><pub-id pub-id-type="doi">10.1007/978-0-387-40065-5</pub-id></element-citation></ref><ref id="BIBR-23"><element-citation publication-type="journal"><article-title>Dynamics of bank’s balance sheet: A system of deterministic and stochastic diferential equations approach</article-title><source>International Journal of Mathematics and Computer Science</source><volume>16</volume><issue>3</issue><person-group person-group-type="author"><name><surname>Ansori</surname><given-names>M.F.</given-names></name><name><surname>Sidarto</surname><given-names>K.A.</given-names></name><name><surname>Sumarti</surname><given-names>N.</given-names></name><name><surname>Gunadi</surname><given-names>I.</given-names></name></person-group><year>2021</year><page-range>871-884,</page-range><ext-link xlink:href="https://future-in-tech.net/16.3/R-Ansori-Sidarto-Sumarti-Gunadi.pdf" ext-link-type="uri" xlink:title="Website link">Website link</ext-link></element-citation></ref></ref-list><fn-group><fn id="fn-1"><p>We  use  the  words  ”risk  measure”  and  ”variability  measure”  interchangeably  when  describing</p><p>RCTV</p></fn><fn id="fn-2"><p>The data is retrieved from the Department of Applied Finance and Actuarial Studies, MacquarieUniversity (accessed on March 24th, 2021)</p></fn></fn-group></back></article>