Extremal Lipschitz continuous aggregation functions with a given diagonal section

2018 ◽  
Vol 346 ◽  
pp. 147-167 ◽  
Author(s):  
J.J. Arias-García ◽  
R. Mesiar ◽  
E.P. Klement ◽  
S. Saminger-Platz ◽  
B. De Baets
Keyword(s):  
Lipschitz Continuous ◽  
Aggregation Functions ◽  
Diagonal Section

Aggregation Functions

2009 ◽  
Author(s):  
Michel Grabisch ◽  
Jean-Luc Marichal ◽  
Radko Mesiar ◽  
Endre Pap
Keyword(s):  
Aggregation Functions

AGGREGATION FUNCTIONS WITH NON-MONOTONIC MEASURES

2008 ◽  
Vol 13 (02) ◽  
Author(s):  
Marta Cardin ◽  
Silvio Giove
Keyword(s):  
Aggregation Functions

On nonhomeomorphic mappings with the inverse Poletsky inequality

2020 ◽  
Vol 17 (3) ◽  
pp. 414-436
Author(s):  
Evgeny Sevost'yanov ◽  
Serhii Skvortsov ◽  
Oleksandr Dovhopiatyi
Keyword(s):  
Boundary Behavior ◽  
Hölder Continuity ◽  
Continuous Extension ◽  
Quasiconformal Mappings ◽  
Holder Continuity ◽  
Hölder Continuous ◽  
Finite Distortion ◽  
Mappings Of Finite Distortion ◽  
Lipschitz Continuous ◽  
Inverse Inequality

As known, the modulus method is one of the most powerful research tools in the theory of mappings. Distortion of modulus has an important role in the study of conformal and quasiconformal mappings, mappings with bounded and finite distortion, mappings with finite length distortion, etc. In particular, an important fact is the lower distortion of the modulus under mappings. Such relations are called inverse Poletsky inequalities and are one of the main objects of our study. The use of these inequalities is fully justified by the fact that the inverse inequality of Poletsky is a direct (upper) inequality for the inverse mappings, if there exist. If the mapping has a bounded distortion, then the corresponding majorant in inverse Poletsky inequality is equal to the product of the maximum multiplicity of the mapping on its dilatation. For more general classes of mappings, a similar majorant is equal to the sum of the values of outer dilatations over all preimages of the fixed point. It the class of quasiconformal mappings there is no significance between the inverse and direct inequalities of Poletsky, since the upper distortion of the modulus implies the corresponding below distortion and vice versa. The situation significantly changes for mappings with unbounded characteristics, for which the corresponding fact does not hold. The most important case investigated in this paper refers to the situation when the mappings have an unbounded dilatation. The article investigates the local and boundary behavior of mappings with branching that satisfy the inverse inequality of Poletsky with some integrable majorant. It is proved that mappings of this type are logarithmically Holder continuous at each inner point of the domain. Note that the Holder continuity is slightly weaker than the classical Holder continuity, which holds for quasiconformal mappings. Simple examples show that mappings of finite distortion are not Lipschitz continuous even under bounded dilatation. Another subject of research of the article is boundary behavior of mappings. In particular, a continuous extension of the mappings with the inverse Poletsky inequality is obtained. In addition, we obtained the conditions under which the families of these mappings are equicontinuous inside and at the boundary of the domain. Several cases are considered: when the preimage of a fixed continuum under mappings is separated from the boundary, and when the mappings satisfy normalization conditions. The text contains a significant number of examples that demonstrate the novelty and content of the results. In particular, examples of mappings with branching that satisfy the inverse Poletsky inequality, have unbounded characteristics, and for which the statements of the basic theorems are satisfied, are given.

scholarly journals Integrating Semilinear Wave Problems with Time-Dependent Boundary Values Using Arbitrarily High-Order Splitting Methods

Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1113
Author(s):  
Isaías Alonso-Mallo ◽  
Ana M. Portillo
Keyword(s):  
Numerical Experiments ◽  
Splitting Method ◽  
Method Of Lines ◽  
Time Integration ◽  
Initial Boundary ◽  
Initial Boundary Value Problem ◽  
High Order ◽  
Time Dependent ◽  
Boundary Values ◽  
Lipschitz Continuous

The initial boundary-value problem associated to a semilinear wave equation with time-dependent boundary values was approximated by using the method of lines. Time integration is achieved by means of an explicit time method obtained from an arbitrarily high-order splitting scheme. We propose a technique to incorporate the boundary values that is more accurate than the one obtained in the standard way, which is clearly seen in the numerical experiments. We prove the consistency and convergence, with the same order of the splitting method, of the full discretization carried out with this technique. Although we performed mathematical analysis under the hypothesis that the source term was Lipschitz-continuous, numerical experiments show that this technique works in more general cases.

scholarly journals No Infimum Gap and Normality in Optimal Impulsive Control Under State Constraints

2021 ◽  
Author(s):  
Giovanni Fusco ◽  
Monica Motta
Keyword(s):  
Original Problem ◽  
State Constraints ◽  
Impulsive Control ◽  
Sufficient Conditions ◽  
Continuous Data ◽  
Lipschitz Continuous ◽  
Extended Sense ◽  
Unbounded Controls ◽  
Locally Lipschitz ◽  
Optimal Impulsive Control

AbstractIn this paper we consider an impulsive extension of an optimal control problem with unbounded controls, subject to endpoint and state constraints. We show that the existence of an extended-sense minimizer that is a normal extremal for a constrained Maximum Principle ensures that there is no gap between the infima of the original problem and of its extension. Furthermore, we translate such relation into verifiable sufficient conditions for normality in the form of constraint and endpoint qualifications. Links between existence of an infimum gap and normality in impulsive control have previously been explored for problems without state constraints. This paper establishes such links in the presence of state constraints and of an additional ordinary control, for locally Lipschitz continuous data.

scholarly journals Unsupervised Offline Changepoint Detection Ensembles

2021 ◽  
Vol 11 (9) ◽  
pp. 4280
Author(s):  
Iurii Katser ◽  
Viacheslav Kozitsin ◽  
Victor Lobachev ◽  
Ivan Maksimov
Keyword(s):  
Numerical Experiment ◽  
Failure Time ◽  
Cost Functions ◽  
Technical Diagnostics ◽  
Classification Problems ◽  
Tennessee Eastman Process ◽  
Changepoint Detection ◽  
Aggregation Functions ◽  
The Individual ◽  
Ensemble Algorithms

Offline changepoint detection (CPD) algorithms are used for signal segmentation in an optimal way. Generally, these algorithms are based on the assumption that signal’s changed statistical properties are known, and the appropriate models (metrics, cost functions) for changepoint detection are used. Otherwise, the process of proper model selection can become laborious and time-consuming with uncertain results. Although an ensemble approach is well known for increasing the robustness of the individual algorithms and dealing with mentioned challenges, it is weakly formalized and much less highlighted for CPD problems than for outlier detection or classification problems. This paper proposes an unsupervised CPD ensemble (CPDE) procedure with the pseudocode of the particular proposed ensemble algorithms and the link to their Python realization. The approach’s novelty is in aggregating several cost functions before the changepoint search procedure running during the offline analysis. The numerical experiment showed that the proposed CPDE outperforms non-ensemble CPD procedures. Additionally, we focused on analyzing common CPD algorithms, scaling, and aggregation functions, comparing them during the numerical experiment. The results were obtained on the two anomaly benchmarks that contain industrial faults and failures—Tennessee Eastman Process (TEP) and Skoltech Anomaly Benchmark (SKAB). One of the possible applications of our research is the estimation of the failure time for fault identification and isolation problems of the technical diagnostics.

scholarly journals Mixed aggregation functions for outliers detection

2021 ◽  
pp. 1-14
Author(s):  
Hengshan Zhang ◽  
Chunru Chen ◽  
Tianhua Chen ◽  
Zhongmin Wang ◽  
Yanping Chen
Keyword(s):  
Aggregation Function ◽  
Outliers Detection ◽  
Aggregation Functions ◽  
Novel Approach ◽  
Consensus Measure

A scenario that often encounters in the event of aggregating options of different experts for the acquisition of a robust overall consensus is the possible existence of extremely large or small values termed as outliers in this paper, which easily lead to counter-intuitive results in decision aggregation. This paper attempts to devise a novel approach to tackle the consensus outliers especially for non-uniform data, filling the gap in the existing literature. In particular, the concentrate region for a set of non-uniform data is first computed with the proposed searching algorithm such that the domain of aggregation function is partitioned into sub-regions. The aggregation will then operate adaptively with respect to the corresponding sub-regions previously partitioned. Finally, the overall aggregation is operated with a proposed novel consensus measure. To demonstrate the working and efficacy of the proposed approach, several illustrative examples are given in comparison to a number of alternative aggregation functions, with the results achieved being more intuitive and of higher consensus.

Sign in / Sign up

Export Citation Format

Share Document