Search results for "convex"
showing 10 items of 389 documents
Further results on H<inf>&#x221E;</inf> control of switched linear time-delay systems
2012
In this note, we study the problems of stability analysis and H ∞ controller synthesis of discrete-time switched systems with time-varying delay. The system under consideration is firstly transformed into an interconnection system. Based on the system transformation and the scaled small gain theorem, the asymptotic stability of the original system is examined via the version of the bounded realness of the transformed forward system. The aim of the proposed approach is to reduce conservatism, which is made possible by a precise approximation of the time-varying delay and the input-output approach. The proposed stability condition is demonstrated to be much less conservative than most existin…
Fuzzy filter design for discrete-time delayed systems with distributed probabilistic sensor faults
2013
In this paper, the problem of distributed fuzzy filter design has been solved for T-S fuzzy systems with time-varying delays and multiple probabilistic packet losses. Our attention is paid to designing the distributed fuzzy filters to guarantee the filtering error dynamic system to be mean-square asymptotically stable with an average ℋ∞ performance. Sufficient conditions for the obtained filtering error dynamic system are proposed by applying a comparison model and the scaled small gain theorem. Based on the measurements and estimates of the system states for each sensor and its neighbors, the solution of the parameters of the distributed fuzzy filters is characterized in terms of the feasi…
The Dunkl–Williams constant, convexity, smoothness and normal structure
2008
Abstract In this paper we exhibit some connections between the Dunkl–Williams constant and some other well-known constants and notions. We establish bounds for the Dunkl–Williams constant that explain and quantify a characterization of uniformly nonsquare Banach spaces in terms of the Dunkl–Williams constant given by M. Baronti and P.L. Papini. We also study the relationship between Dunkl–Williams constant, the fixed point property for nonexpansive mappings and normal structure.
Stackelberg equilibrium with many leaders and followers. The case of zero fixed costs
2017
Abstract I study a version of the Stackelberg game with many identical firms in which leaders and followers use a continuous cost function with no fixed cost. Using lattice theoretical methods I provide a set of conditions that guarantee that the game has an equilibrium in pure strategies. With convex costs the model shows the same properties as a quasi-competitive Cournot model. The same happens with concave costs, but only when the number of followers is small. When this number is large the leaders preempt entry. I study the comparative statics and the limit behavior of the equilibrium and I show how the main determinants of market structure interact. More competition between the leaders …
Consistent shakedown theorems for materials with temperature dependent yield functions
2000
The (elastic) shakedown problem for structures subjected to loads and temperature variations is addressed in the hypothesis of elastic-plastic rate-independent associative material models with temperature-dependent yield functions. Assuming the yield functions convex in the stress/temperature space, a thermodynamically consistent small-deformation thermo-plasticity theory is provided, in which the set of state and evolutive variables includes the temperature and the plastic entropy rate. Within the latter theory the known static (Prager's) and kinematic (König's) shakedown theorems - which hold for yield functions convex in the stress space - are restated in an appropriate consistent format…
Conditional convex orders and measurable martingale couplings
2014
Strassen's classical martingale coupling theorem states that two real-valued random variables are ordered in the convex (resp.\ increasing convex) stochastic order if and only if they admit a martingale (resp.\ submartingale) coupling. By analyzing topological properties of spaces of probability measures equipped with a Wasserstein metric and applying a measurable selection theorem, we prove a conditional version of this result for real-valued random variables conditioned on a random element taking values in a general measurable space. We also provide an analogue of the conditional martingale coupling theorem in the language of probability kernels and illustrate how this result can be appli…
Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
1984
Let f: N ? R a convex function and x I Ni, where N is a convex set in a real linear space. It is stated that, if Df<(x) is not empty, then Df<(x) is the algebraic interior of Df=(x).
Archetypoids: A new approach to define representative archetypal data
2015
[EN] The new concept archetypoids is introduced. Archetypoid analysis represents each observation in a dataset as a mixture of actual observations in the dataset, which are pure type or archetypoids. Unlike archetype analysis, archetypoids are real observations, not a mixture of observations. This is relevant when existing archetypal observations are needed, rather than fictitious ones. An algorithm is proposed to find them and some of their theoretical properties are introduced. It is also shown how they can be obtained when only dissimilarities between observations are known (features are unavailable). Archetypoid analysis is illustrated in two design problems and several examples, compar…
(φ, ψ)-weak contractions in intuitionistic fuzzy metric spaces
2014
The purpose of this paper is to extend the notion of (phi,psi)-weak contraction to intuitionistic fuzzy metric spaces, by using an altering distance function. We obtain common fixed point results in intuitionistic fuzzy metric spaces, which generalize several known results from the literature.
Establishing some order amongst exact approximations of MCMCs
2016
Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard MCMC algorithms, such as the target probability density in a Metropolis-Hastings algorithm, with estimators. Perhaps surprisingly, such approximations lead to powerful algorithms which are exact in the sense that they are guaranteed to have correct limiting distributions. In this paper we discover a general framework which allows one to compare, or order, performance measures of two implementations of such algorithms. In particular, we establish an order …