M. Brion proved a convexity result for the moment map image of an irreducible subvariety of a compact integral Kähler manifold preserved by the complexification of the Hamiltonian group action. V. Guillemin and R. Sjamaar generalized this result to irreducible subvarieties preserved only by a Borel subgroup. In another direction, L. O’Shea and R. Sjamaar proved a convexity result for the moment...

This paper proposes a simplex statistic for testing the joint curvature (e.g., linearity, concavity, or convexity) of a nonparametric regression function. The statistic is based on Jensen’s inequality applied to all (m+ 2)-tuples in the data having one data point in the interior of the (m+1)-dimension simplex spanned by the remaining data points (m is the dimension of the covariate vector). The...

The original definition of a topological space given by Hausdorff used neighborhood systems. Lattice-valued maps appear in this context when you identify a topology with a monoid in the Kleisli category of the filter monad on SET. H?hle’s notion of a lattice-valued topology [2] uses the same idea and it’s inspired in the classical lattice-valued topologies. Ltopological spaces are motivated by ...

In that paper, the fuzzy nonlinear programming problem is discussed. In order to obtain more accurate solution, the properties of fuzzy set and fuzzy number with linear membership function and fuzzy maximum decision maker is utilized to fuzzifying the crisp problem. In the illustration, we have given a refinement to obtain this solution.

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

In this note based on paper [3] we deal with domains D (i.e. connected open subsets) of a Finsler manifold (M, F ). At first we carry out a comparison between different notions of convexity for their boundaries. Then a careful application of variational methods to the geodesic problem yields that the convexity of ∂D is equivalent to the existence of a minimal geodesic for each pair of points of...

We consider linearly independent families of Hermitian matrices {A1, . . . , Am} so thatWk(A) is convex. It is shown that m can reach the upper bound 2k(n− k) + 1. A key idea in our study is relating the convexity of Wk(A) to the problem of constructing rank k orthogonal projections under linear constraints determined by A. The techniques are extended to study the convexity of other generalized...