Convexity preserving interpolation by splines of arbitrary degree

Verlan, Igor
April 2010
Computer Science Journal of Moldova;2010, Vol. 18 Issue 1, p54
Academic Journal
In the present paper an algorithm of C2 interpolation of discrete set of data is given using splines of arbitrary degree, which preserves the convexity of given set of data.


Related Articles

  • An outcome space approach for generalized convex multiplicative programs. Oliveira, R�bia M.; Ferreira, Paulo A. V. // Journal of Global Optimization;May2010, Vol. 47 Issue 1, p107 

    This paper addresses the problem of minimizing an arbitrary finite sum of products of two convex functions over a convex set. Nonconvex problems in this form constitute a class of generalized convex multiplicative problems. Convex analysis results allow to reformulate the problem as an...

  • Locally Quasi-Convex Compatible Topologies on a Topological Group. Außenhofer, Lydia; Dikranjan, Dikran; Martín-peinador, Elena // Axioms (2075-1680);2015, Vol. 4 Issue 4, p436 

    For a locally quasi-convex topological abelian group (G; Ï„), we study the poset b (G; Ï„) of all locally quasi-convex topologies on G that are compatible with Ï„ (i.e., have the same dual as (G; Ï„)) ordered by inclusion. Obviously, this poset has always a bottom element, namely the...

  • STRONG AND WEAK CONVEXITY OF SETS AND FUNCTIONS. Vial, Jean-Philippe // Mathematics of Operations Research;May83, Vol. 8 Issue 2, p231 

    In this paper we study two classes of sets, strongly and weakly convex sets. For each class we derive a series of properties which involve either the concept of supporting ball, an obvious extension of the concept of supporting hyperplane, or the normal cone to the set. We also study a class of...

  • Quasi-convex Functions in Carnot Groups*. Mingbao Sun; Xiaoping Yang // Chinese Annals of Mathematics;Apr2007, Vol. 28 Issue 2, p235 

    In this paper, the authors introduce the concept of h-quasiconvex functions on Carnot groups G. It is shown that the notions of h-quasiconvex functions and h-convex sets are equivalent and the L ∞ estimates of first derivatives of h-quasiconvex functions are given. For a Carnot group G of...

  • Spatial Numerical Range of Operators on Weighted Hardy Spaces. Abdollahi, Abdolaziz; Heydari, Mohammad Taghi // International Journal of Mathematics & Mathematical Sciences;2011, p1 

    We consider the spatial numerical range of operators on weighted Hardy spaces and give conditions for closedness of numerical range of compact operators. We also prove that the spatial numerical range of finite rank operators on weighted Hardy spaces is star shaped; though, in general, it does...

  • A single interval based classifier. Kim, Heeyoung; Huo, Xiaoming; Shi, Jianjun // Annals of Operations Research;May2014, Vol. 216 Issue 1, p307 

    In many applications, it is desirable to build a classifier that is bounded within an interval. Our motivating example is rooted in monitoring in a stamping process. A novel approach is proposed and examined in this paper. Our method consists of three stages: (1) A baseline of each class is...

  • Some properties of convex hulls of integer points contained in general convex sets. Dey, Santanu S.; Morán R., Diego A. // Mathematical Programming;Oct2013, Vol. 141 Issue 1/2, p507 

    In this paper, we study properties of general closed convex sets that determine the closedness and polyhedrality of the convex hull of integer points contained in it. We first present necessary and sufficient conditions for the convex hull of integer points contained in a general convex set to...

  • Convex Location Problems on Tree Networks. Dearing, P. M.; Francis, R. L.; Lowe, T. J. // Operations Research;Jul/Aug76, Vol. 24 Issue 4, p628 

    This paper studies problems of finding optimal facility locations on an imbedding of a finite, undirected network having positive arc lengths. We establish that a large class of such problems is convex, in a well defined sense, for all choices of the data if and only if the network is a tree. A...

  • Computing deep facet-defining disjunctive cuts for mixed-integer programming. Cadoux, Florent // Mathematical Programming;Apr2010, Vol. 122 Issue 2, p197 

    The problem of separation is to find an affine hyperplane, or �cut�, that lies between the origin O and a given closed convex set Q in a Euclidean space. We study cuts which are deep in a well-defined geometrical sense, and facet-defining. The cases when the deepest cut is decomposable...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics