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
Sensitivity Analysis for Mirror-Stratifiable Convex Functions [PDF]
, 2018 This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable".
Fadili, Jalal +2 more
core +5 more sources
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 enumeration of column-convex permutominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application of ...
Nicholas R. Beaton +3 more
doaj +1 more source
HPPD: A Hybrid Parallel Framework of Partition-based and Density-based Clustering Algorithms in Data Streams [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2020 Data stream clustering refers to the process of grouping continuously arriving new data chunks into continuously changing groups to enable dynamic analysis of segmentation patterns.
Ammar Abd Alazeez
doaj +1 more source
Nonlinear analysis in p-vector spaces for single-valued 1-set contractive mappings
Fixed Point Theory and Algorithms for Sciences and Engineering, 2022 The goal of this paper is to develop some fundamental and important nonlinear analysis for single-valued mappings under the framework of p-vector spaces, in particular, for locally p-convex spaces for 0 < p ≤ 1 $0 < p \leq 1$ .
George Xianzhi Yuan
doaj +1 more source
DC Proximal Newton for Non-Convex Optimization Problems [PDF]
, 2015 We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions.
Flamary, Remi +2 more
core +4 more sources
Variational methods in the presence of symmetry
Advances in Nonlinear Analysis, 2013 The purpose of this paper is to survey and to provide a unified framework to connect a diverse group of results, currently scattered in the literature, that can be usefully viewed as consequences of applying variational methods to problems involving ...
Borwein Jonathan M., Zhu Qiji J.
doaj +1 more source
Quantitative Stability of Linear Infinite Inequality Systems under Block Perturbations with Applications to Convex Systems [PDF]
, 2011 The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp.
AD Ioffe +22 more
core +5 more sources
A novel and efficient approach for line segment clipping against a convex polygon
Ruhuna Journal of Science, 2019 This paper proposes a new line clipping algorithm against a convex polygon with 𝑂(𝑁) time complexity. The line segment is pruned against each extended edge of the polygon as the first step of the proposed algorithm.
K. R. Wijeweera +2 more
doaj +1 more source