Results 11 to 20 of about 621,582 (323)
General optimal euclidean Sobolev and Gagliardo-Nirenberg inequalities
Anais da Academia Brasileira de Ciências, 2005 We prove general optimal euclidean Sobolev and Gagliardo-Nirenberg inequalities by using mass transportation and convex analysis results. Explicit extremals and the computation of some optimal constants are also provided.
Jurandir Ceccon, Marcos Montenegro
doaj +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
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
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 +4 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
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
Variational Methods in Convex Analysis [PDF]
Journal of Global Optimization, 2006 The authors use variational arguments, namely minimization arguments and decoupling mechanisms, to derive some fundamental theorems in convex analysis. Many important result in linear functional analysis can then be deduced as special cases.
Borwein, Jonathan M., Zhu, Qiji J.
openaire +2 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 $\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