Results 21 to 30 of about 649,418 (326)

An algebraic approach to the variants of convexity for soft expert approximate function with intuitionistic fuzzy setting

open access: yesJournal of Taibah University for Science, 2023
A new area of research called intuitionistic fuzzy soft expert set is expected to overcome the drawbacks of an intuitionistic fuzzy soft set in terms of eligibility for soft expert-argument approximate function.
Muhammad Ihsan   +3 more
doaj   +1 more source

Relationships Between Polyhedral Convex Sets and Generalized Polyhedral Convex Sets

open access: yesJournal of Optimization Theory and Applications, 2023
In this paper we study some relationships between polyhedral convex sets (PCS) and generalized polyhedral convex sets (GPCS). In particular, we clarify by a counterexample that the necessary and sufficient conditions for the separation of a convex set and a PCS obtained by Kung Fu Ng and Wen Song in [Fenchel duality in finite-dimensional setting and ...
Nguyen Ngoc Luan   +3 more
openaire   +4 more sources

Point Cloud Repair Method via Convex Set Theory

open access: yesApplied Sciences, 2023
The point cloud is the basis for 3D object surface reconstruction. An incomplete point cloud significantly reduces the accuracy of downstream work such as 3D object reconstruction and recognition.
Tianzhen Dong   +3 more
doaj   +1 more source

Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming

open access: yesIbn Al-Haitham Journal for Pure and Applied Sciences, 2023
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

Minimal Total Area Convex Set Partitioning Problem

open access: yesCommunications, 2009
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

On a Class of Generalized Nonexpansive Mappings

open access: yesMathematics, 2020
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]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012
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

Three convex sets [PDF]

open access: yesProceedings of the American Mathematical Society, 1983
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

open access: yesМоделирование и анализ информационных систем, 2015
In this paper we consider theorems which are generalizations of the well-known corollaries of the Helly ...
V. L. Dolnikov
doaj   +1 more source

Constructible Convex Sets

open access: yesSet-Valued Analysis, 2004
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

Home - About - Disclaimer - Privacy