Results 31 to 40 of about 649,418 (326)
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 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
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
Projections Onto Convex Sets (POCS) Based Optimization by Lifting [PDF]
, 2013 Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented.
Bozkurt, A. +7 more
core +2 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
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
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
Number of Spinal-Convex Polyominoes
Journal of Kufa for Mathematics and Computer, 2020 In his paper we describe a restricted class of polyominoes called spinal-convex polyominoes. Spinal-convex polyominoes created by two columns such that column 1 (respectively, column2) with at most two set columns sequence of adjacent ominoes and column ...
Mustafa A. Sabri, Eman F. Mohomme
doaj +1 more source
Core equivalence theorems for infinite convex games [PDF]
, 1996 We show that the core of a continuous convex game on a measurable space of players is a von Neumann-Morgenstern stable set. We also extend the definition of the Mas-Colell bargaining set to games with a measurable space of players, and show that for ...
Einy, Ezra +3 more
core +3 more sources
Known Results and Open Problems in Hypercomplex Convexity
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 A subject, which is treated in this review, combines in one bundle some questions of convex, hypercomplex analysis, probability theory and geometry.
Zelinskii Yuri
doaj +1 more source