state conditions under which there exist solutions to x = f(x) for the singlevalued function f or to Y E F(y ) for the set-valued mapping F. The prototype of the former is the contraction mapping theorem, while that of the latter is the Kakutani fixed point theorem. These results, as well as generalizations, applications, and other references, are surveyed in [ 14 ]. A representative sample of ...

In this paper, we study continuity and Lipschitzian properties of set-valued mappings, focusing on inner-type conditions. We introduce new notions inner calmness* and, its relaxation, fuzzy calmness*. show that polyhedral maps enjoy examine (fuzzy) a multiplier mapping associated with constraint systems in depth. Then utilize these to develop some rules generalized differential calculus, mainly...

The paper presents several improvements to our synthesis platform Xsynth that was developed targeting advanced logic synthesis and technological mapping for k-LUT based FPGAs. Having implemented an efficient exhaustive k-feasible cone generator it was targeted delay optimum mapping and optimal area. Implemented algorithm can use common unit-delay model and, the more general, the edge-delay mode...

Soil property mapping is commonly done in two dimensions, and variation by depth is ignored. The only way to consider the vertical variation is mapping in 3D. In this paper, we present a method based on polynomial depth functions. The objective is determining the effectiveness of a simple polynomial to predict cone-index data by depth over a field. In order to study the performances of the prop...

where C is a convex closed cone in the Euclidean space IR, f : IR → IR and G : IR → Y is a mapping from IR into the space Y := S of m × m symmetric matrices. We refer to the above problem as a nonlinear semidefinite programming problem. In particular, if C = IR, the objective function is linear, i.e. f(x) := ∑n i=1 bixi, and the constraint mapping is affine, i.e. G(x) := A0 + ∑n i=1 xiAi where ...

In this paper, we study the mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with a parametric generalized equation involving the regular normal cone. Compared with the usual way of formulating MPEC through a KKT condition, this formulation has the advantage that it does not involve extra multipliers as new variables, and it usually requires weaker a...

We introduce methods which seem to be a new and promising tool in hierarchical fixedpoint problems. The goal of this note is to analyze the convergence properties of these new types of approximating methods for fixed-point problems. The limit attained by these curves is the solution of the general variational inequality, 0 ∈ (I −Q)x∞ +NFixP(x∞), where NFixP denotes the normal cone to the set of...