Results 21 to 30 of about 646,901 (273)
Matrix Convex Hulls of Free Semialgebraic Sets [PDF]
, 2013 This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix convex sets $C$ and their projections $\hat C$.
Helton, J. William +2 more
core +1 more source
Compositions and Averages of Two Resolvents: Relative Geometry of Fixed Points Sets and a Partial Answer to a Question by C. Byrne [PDF]
, 2010 We show that the set of fixed points of the average of two resolvents can be found from the set of fixed points for compositions of two resolvents associated with scaled monotone operators.
Bauschke, Heinz H., Wang, Xianfu
core +1 more source
On Some Corollaries of a Transversal Theorem
Моделирование и анализ информационных систем, 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
Set-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
On the convex layers of a planer dynamic set of points
Ceylon Journal of Science, 2018 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
Coxeter group in Hilbert geometry [PDF]
, 2015 A theorem of Tits - Vinberg allows to build an action of a Coxeter group $\Gamma$ on a properly convex open set $\Omega$ of the real projective space, thanks to the data $P$ of a polytope and reflection across its facets.
Marquis, Ludovic
core +3 more sources
Computation of the Hausdorff Distance between Two Compact Convex Sets
Algorithms, 2023 The Hausdorff distance between two closed sets has important theoretical and practical applications. Yet apart from finite point clouds, there appear to be no generic algorithms for computing this quantity.
Kenneth Lange
doaj +1 more source
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Journal of Function Spaces, 2022 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
Ball and Spindle Convexity with respect to a Convex Body [PDF]
, 2012 Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$.
Lángi, Zsolt +2 more
core +2 more sources
NP-completeness of weakly convex and convex dominating set decision problems [PDF]
Opuscula Mathematica, 2004 The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs.
Joanna Raczek
doaj