Search results for "convergence"
showing 10 items of 655 documents
Urban poverty: Measurement theory and evidence from American cities
2021
AbstractWe characterize axiomatically a new index of urban poverty that i) captures aspects of the incidence and distribution of poverty across neighborhoods of a city, ii) is related to the Gini index and iii) is consistent with empirical evidence that living in a high poverty neighborhood is detrimental for many dimensions of residents’ well-being. Widely adopted measures of urban poverty, such as the concentrated poverty index, may violate some of the desirable properties we outline. Furthermore, we show that changes of urban poverty within the same city are additively decomposable into the contribution of demographic, convergence, re-ranking and spatial effects. We collect new evidence …
Discrete-Time Adaptive Hysteresis Filter for Parallel Computing and Recursive Identification of Preisach Model
2018
High-precision motion control systems, for instance deployed for micro- and nano-positioning, often use the smart-material based actuators such as piezoelectric and magnetostrictive stages. Those exhibit inherent hysteresis nonlinearities which are challenging to compensate without precise hysteresis modeling. Even if a suitable hysteresis modeling approach is available, its parameter identification, correspondingly adaptation, at normal operating conditions constitute an essential task for the overall control design. This paper uses the direct recursive identification method for the Preisach hysteresis model and describes the fast parallel-computing discrete-time algorithm for an adaptive …
Some remarks on unconditionally convergent multipliers
2017
We present some results concerning the representation of unconditionally convergent multipliers, including a reformulation of a conjecture of Balazs and Stoeva.
The Kuratowski convergence and connected components
2012
International audience; We investigate the Kuratowski convergence of the connected components of the sections of a definable set applying the result obtained to semialgebraic approximation of subanalytic sets. We are led to some considerations concerning the connectedness of the limit set in general. We discuss also the behaviour of the dimension of converging sections and prove some general facts about the Kuratowski convergence in tame geometry.
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
Large time behavior for a porous medium equation in a nonhomogeneous medium with critical density
2014
Abstract We study the large time behavior of solutions to the Cauchy problem for the porous medium equation in nonhomogeneous media with critical singular density | x | − 2 ∂ t u = Δ u m , in R N × ( 0 , ∞ ) , where m > 1 and N ≥ 3 , with nonnegative initial condition u ( x , 0 ) = u 0 ( x ) ≥ 0 . The asymptotic behavior proves to have some interesting and striking properties. We show that there are different asymptotic profiles for the solutions, depending on whether the continuous initial data u 0 vanishes at x = 0 or not. Moreover, when u 0 ( 0 ) = 0 , we show the convergence towards a peak-type profile presenting a jump discontinuity, coming from an interesting asymptotic simplification…
Contribution to variational analysis : stability of tangent and normal cones and convexity of Chebyshev sets
2014
The aim of this thesis is to study the following three problems: 1) We are concerned with the behavior of normal cones and subdifferentials with respect to two types of convergence of sets and functions: Mosco and Attouch-Wets convergences. Our analysis is devoted to proximal, Fréchet, and Mordukhovich limiting normal cones and subdifferentials. The results obtained can be seen as extensions of Attouch theorem to the context of non-convex functions on locally uniformly convex Banach space. 2) For a given bornology β on a Banach space X we are interested in the validity of the following "lim inf" formula (…).Here Tβ(C; x) and Tc(C; x) denote the β-tangent cone and the Clarke tangent cone to …
On Fixed Point (Trial) Methods for Free Boundary Problems
1992
In this note we consider the trial methods for solving steady state free boundary problems. For two test examples (electrochemical machining and continuous casting) we discuss the convergence of a fixed point method. Moreover, using the techniques of shape optimization we introduce a modification of the method, which gives us superlinear convergence rate. This is also confirmed numerically.
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…