Results 21 to 30 of about 6,990,145 (303)
Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming
The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively.
Revan I. Hazim, Saba N. Majeed
doaj +1 more source
On a Class of Generalized Nonexpansive Mappings
In our recent work we have introduced and studied a notion of a generalized nonexpansive mapping. In the definition of this notion the norm has been replaced by a general function satisfying certain conditions.
Simeon Reich, Alexander J. Zaslavski
doaj +1 more source
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET [PDF]
Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set.
Z. Fu, Y. Lu
doaj +1 more source
Minimal Total Area Convex Set Partitioning Problem
The linear binary model for finding set partitioning of the points in the plane is studied. We present heuristic which generates partitioning of points to clusters for a given number of seeds with searched seeds of clusters in a plane.
Stefan Pesko
doaj +1 more source
We construct a Choquet simplex K K such that there is a universally measurable affine function f f on K K , which satisfies the barycentric calculus, and is zero on the set of extreme points, but is not identically zero.
openaire +1 more source
On Some Corollaries of a Transversal Theorem
In this paper we consider theorems which are generalizations of the well-known corollaries of the Helly ...
V. L. Dolnikov
doaj +1 more source
A closed convex subset of a Banach space \(X\) is called constructible if it can be written as a countable intersection of closed half-spaces in \(X\). A subset \(C\) of the dual \(X^*\) of \(X\) is called \(w^*\)-constructible if it can be written as a countable intersection of \(w^*\)-closed half-spaces in \(X^*\), i.e., half-spaces determined by ...
Borwein, Jonathan M. +1 more
openaire +3 more sources
Optimal rates of convergence for convex set estimation from support functions [PDF]
We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator.
Adityanand Guntuboyina
semanticscholar +1 more source
On the convex layers of a planer dynamic set of points
The convex hull of a planer set of points can be defined as the set of vertices of the smallest convex polygon containing all the points. If S is a planer set of points then convex layers of S can be derived by iteratively computing the convex hull of S ...
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued ...
Atiqe Ur Rahman +3 more
doaj +1 more source

