On stability of maximal entropy OWA operator weights

The maximal entropy OWA operator (MEOWA) weights can be obtained by solving a nonlinear programming problem with a linear constraint for the level of orness. Since the exact MEOWA weights are not known for the general case we can only find approximate solutions. We will prove that the nonlinear prog...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Fuzzy sets and systems Ročník 448; s. 145 - 156
Hlavní autoři: Harmati, István Á., Fullér, Robert, Felde, Imre
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 05.11.2022
Témata:
Implicit function theorem
Maximal entropy OWA operator weights
Stability
Maximal entropy OWA operator weights
Implicit function theorem
Stability
ISSN:0165-0114, 1872-6801
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The maximal entropy OWA operator (MEOWA) weights can be obtained by solving a nonlinear programming problem with a linear constraint for the level of orness. Since the exact MEOWA weights are not known for the general case we can only find approximate solutions. We will prove that the nonlinear programming problem for obtaining MEOWA weights is well-posed: it has a unique solution and each MEOWA weight changes continuously with the initial level of orness. Using the implicit function theorem we will show that MEOWA weights are Lipschitz-continuous functions of the orness level. The stability property of the MEOWA weights under small changes of the orness level guarantees that small rounding errors of digital computation and small errors of measurement of the orness level can cause only a small deviation in MEOWA weights, i.e. every successive approximation method can be applied to the computation of the approximation of the exact MEOWA weights.
ISSN:0165-0114
1872-6801
DOI:10.1016/j.fss.2022.01.003