Results 21 to 30 of about 615,016 (327)
Controllability on infinite-dimensional manifolds [PDF]
, 2012 Following the unified approach of A. Kriegl and P.W. Michor (1997) for a treatment of global analysis on a class of locally convex spaces known as convenient, we give a generalization of Rashevsky-Chow's theorem for control systems in regular connected ...
A. Isidori +61 more
core +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
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
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
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
On $\mathscr{M}$-convex functions
AIMS Mathematics, 2020 In this article, we introduce the notion of $\mathscr{M}$-convex functions, $\log$-$\mathscr{M}$-convex functions and the notion of quasi $\mathscr{M}$-convex functions. We derive some new analogues of Hermite-Hadamard like inequalities associated with $\
Muhammad Uzair Awan +3 more
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
Introduction to Convex and Quasiconvex Analysis [PDF]
, 2006 In the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within ℝn together with their primal and dual representations. In Section 3 we apply the results for convex sets to convex and quasiconvex functions and show
J.B.G. Frenk, G. Kassay
openaire +4 more sources
A class of degenerate elliptic eigenvalue problems
Advances in Nonlinear Analysis, 2013 We consider a general class of eigenvalue problems where the leading elliptic term corresponds to a convex homogeneous energy function that is not necessarily differentiable.
Lucia Marcello, Schuricht Friedemann
doaj +1 more source