We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence....

the aim of this paper is to prove some inequalities for p-valent meromorphic functions in thepunctured unit disk δ* and find important corollaries.

We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z. We consider two kinds of convexity of a fuzzy set, namely quasi convexity and strong convexity, and we propose two algorithms for the construction of both kinds of convex hull of a digital fuzzy set.

Let C be a closed convex subset of a Banach space E. A mapping T on C is called a nonexpansive mapping if ‖Tx−Ty‖ ≤ ‖x− y‖ for all x, y ∈ C. We denote by F(T) the set of fixed points of T . Kirk [17] proved that F(T) is nonempty in the case that C is weakly compact and has normal structure. See also [2, 3, 5, 6, 11] and others. Convergence theorems to fixed points are also proved by many author...

We deal with different properties of a smooth and strictly convex body that depend on the behavior of the planar sections of the body parallel to and close to a given tangent plane. The first topic is boundary points where any given convex domain in the tangent plane can be approximated by a sequence of suitably rescaled planar sections (so-called p-universal points). In the second topic, the g...

We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with Õ(n) oracle calls and Õ(n) additional arithmetic operations. Using this result, we obtain more efficient reductions among the five basic oracles for convex sets and func...

This paper concerns a closedness condition called (CC), requiring a convex function and a convex constrained system. This type of condition has played an important role in the study of convex optimization problems. Our aim is to establish several characterizations of this condition and to apply them to study minimizing problems involving a DC function under a cone-convex constraint and a set co...

We first obtain some properties of a fundamentally nonexpansive self-mapping on a nonempty subset of a Banach space and next show that if the Banach space is having the Opial condition, then the fixed points set of such a mapping with the convex range is nonempty. In particular, we establish that if the Banach space is uniformly convex, and the range of such a mapping is bounded, closed and con...

The concept of M-convex function, introduced recently by Murota, is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress–Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete op...