Results 21 to 30 of about 6,795,119 (352)
Error Function and Certain Subclasses of Analytic Univalent Functions [PDF]
Sahand Communications in Mathematical Analysis, 2023 In the present investigation, our main aim is to introduce a certain subclass of analytic univalent functions related to the Error function. We discuss the implications of our main results, including the coefficient bound, extreme points, weighted mean ...
Seyed Hadi Sayedain Boroujeni +1 more
doaj +1 more source
On supportless convex sets [PDF]
Proceedings of the American Mathematical Society, 1985 We give some general constructions of supportless convex subsets of normed spaces and pose a number of open questions.
Borwein, J. M., Tingley, D. W.
openaire +1 more source
Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming
Ibn 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
Covering graphs with convex sets and partitioning graphs into convex sets [PDF]
Information Processing Letters, 2020 We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity, $P_3$-convexity, and $P_3^*$-convexity.
Lucía M. González +3 more
openaire +4 more sources
Strongly convex functions, Moreau envelopes and the generic nature of convex functions with strong minimizers [PDF]
, 2015 In this work, using Moreau envelopes, we define a complete metric for the set of proper lower semicontinuous convex functions. Under this metric, the convergence of each sequence of convex functions is epi-convergence.
Planiden, Chayne, Wang, Xianfu
core +3 more sources
, 2015 State spaces in probabilistic and quantum computation are convex sets, that is, Eilenberg–Moore algebras of the distribution monad. This article studies some computationally relevant properties of convex sets. We introduce the term effectus for a category with suitable coproducts (so that predicates, as arrows of the shape X → 1 + 1, form effect ...
Bart Jacobs +2 more
openaire +3 more sources
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET [PDF]
The 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
Point Cloud Repair Method via Convex Set Theory
Applied 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
Lifts of convex sets and cone factorizations [PDF]
, 2012 In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone.
Barvinok A +6 more
core +4 more sources
Combinatorics, Probability and Computing, 2011 A set of reals A = {a1,. . .,an} is called convex if ai+1 − ai > ai − ai−1 for all i. We prove, among other results, that for some c > 0 every convex A satisfies |A−A| ≥ c|A|8/5log−2/5|A|.
Ilya D. Shkredov, Tomasz Schoen
openaire +3 more sources