Cross-product of Bessel functions: Monotonicity patterns and functional inequalities

In this paper, we study the Dini functions and the cross-product of Bessel functions. Moreover, we are interested on the monotonicity patterns for the cross-product of Bessel and modified Bessel functions. In addition, we deduce Redheffer-type inequalities, and the interlacing property of the zeros of Dini functions and the cross-product of Bessel and modified Bessel functions. Bounds for logarithmic derivatives of these functions are also derived. The key tools in our proofs are some recently developed infinite product representations for Dini functions and cross-product of Bessel functions.     

A function class of strictly positive definite and logarithmically completely monotonic functions related to the modified Bessel functions

In this paper, we give some conditions for a class of functions related to Bessel functions to be positive definite or strictly positive definite. We present some properties and relationships involving logarithmically completely monotonic functions and strictly positive definite functions. In particular, we are interested with the modified Bessel functions of the second kind. As applications, we prove the logarithmically monotonicity for a class of functions involving the modified Bessel functions of second kind and we established new inequalities for this function.     

Computing Special Functions by Using Quadrature Rules

The usual tools for computing special functions are power series, asymptotic expansions, continued fractions, differential equations, recursions, and so on. Rather seldom are methods based on quadrature of integrals. Selecting suitable integral representations of special functions, using principles from asymptotic analysis, we develop reliable algorithms which are valid for large domains of real or complex parameters. Our present investigations include Airy functions, Bessel functions and parabolic cylinder functions. In the case of Airy functions we have improvements in both accuracy and speed for some parts of Amos's code for Bessel functions.     

The algebra of set functions I: The product theorem and duality

We give a comprehensive introduction to the algebra of set functions and its generating functions. This algebraic tool allows us to formulate and prove a product theorem for the enumeration of functions of many different kinds, in particular injective functions, surjective functions, matchings and colourings of the vertices of a hypergraph. Moreover, we develop a general duality theory for counting functions.     

On biconjugates of infimal functions

We deliver formulae for the biconjugate functions of some infimal functions that hold provided the fulfilment of weak regularity conditions of both closedness and interiority types. As special cases, we obtain biconjugates of infimal convolutions of finitely many functions, of optimal value functions of both constrained and unconstrained optimization problems as well as of marginal functions associated with multifunctions (that can be, for instance, convex processes) and some given functions. Moreover, we rediscover or extend different results on biconjugate functions from the literature.     

Cauchy and Poisson formulas for polyanalytic functions and applications

We obtain new Cauchy and Poisson integral formulas for polyanalytic functions. As an application, we establish mean value theorems for polyanalytic and real polyharmonic functions in a disk. We also give applications to sharp estimates of generalized maximum modulus principle type for associated functions, and, in particular, to estimates for rational functions (components) in the problem of singularity separation for polyrational functions.     

Quasisymmetric Schur functions

We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur functions, since the basis elements refine Schur functions in a natural way. We derive expansions for quasisymmetric Schur functions in terms of monomial and fundamental quasisymmetric functions, which give rise to quasisymmetric refinements of Kostka numbers and standard (reverse) tableaux. From here we derive a Pieri rule for quasisymmetric Schur functions that naturally refines the Pieri rule for Schur functions. After surveying combinatorial formulas for Macdonald polynomials, including an expansion of Macdonald polynomials into fundamental quasisymmetric functions, we show how some of our results can be extended to include the t parameter from Hall-Littlewood theory.     

A construction of bent functions from plateaued functions

In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analyzed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent functions having some additional properties that enable the construction of strongly regular graphs are formed, and explicit expressions for bent functions with maximal degree are presented.     

A unifying theory of exactness of linear penalty functions II: parametric penalty functions

In this article, we develop a general theory of exact parametric penalty functions for constrained optimization problems. The main advantage of the method of parametric penalty functions is the fact that a parametric penalty function can be both smooth and exact unlike the standard (i.e. non-parametric) exact penalty functions that are always nonsmooth. We obtain several necessary and/or sufficient conditions for the exactness of parametric penalty functions, and for the zero duality gap property to hold true for these functions. We also prove some convergence results for the method of parametric penalty functions, and derive necessary and sufficient conditions for a parametric penalty function to not have any stationary points outside the set of feasible points of the constrained optimization problem under consideration. In the second part of the paper, we apply the general theory of exact parametric penalty functions to a class of parametric penalty functions introduced by Huyer and Neumaier, and to smoothing approximations of nonsmooth exact penalty functions. The general approach adopted in this article allowed us to unify and significantly sharpen many existing results on parametric penalty functions.     

Jensen measures and boundary values of plurisubharmonic functions

We study different classes of Jensen measures for plurisubharmonic functions, in particular the relation between Jensen measures for continuous functions and Jensen measures for upper bounded functions. We prove an approximation theorem for plurisubharmonic functions inB-regular domain. This theorem implies that the two classes of Jensen measures coincide inB-regular domains. Conversely we show that if Jensen measures for continuous functions are the same as Jensen measures for upper bounded functions and the domain is hyperconvex, the domain satisfies the same approximation theorem as above. The paper also contains a characterisation in terms of Jensen measures of those continuous functions that are boundary values of a continuous plurisubharmonic function.     

Harmonic functions on hypergroups

We initiate a study of harmonic functions on hypergroups. In particular, we introduce the concept of a nilpotent hypergroup and show such hypergroup admits an invariant measure as well as a Liouville theorem for bounded harmonic functions. Further, positive harmonic functions on nilpotent hypergroups are shown to be integrals of exponential functions. For arbitrary hypergroups, we derive a Harnack inequality for positive harmonic functions and prove a Liouville theorem for compact hypergroups. We discuss an application to harmonic spherical functions.     

Subvexormal Functions and Subvex Functions

Subvexormal functions and subinvexormal functions are proposed, whose properties are shared commonly by most generalized convex functions and most generalized invex functions, respectively. A necessary and sufficient condition for a subvexormal function to be subinvexormal is given in the locally Lipschitz and regular case. Furthermore, subvex functions and subinvex functions are introduced. It is proved that the class of strictly subvex functions is equivalent to that of functions whose local minima are global and that, in the locally Lipschitz and regular case, both strongly subvex functions and strongly subinvex functions can be characterized as functions whose relatively stationary points (slight extension of stationary points) are global minima.     

Inequalities for formal power series and entire functions

We present several integral and exponential inequalities for formal power series and for both arbitrary entire functions of exponential type and generalized Borel transforms. They are obtained through certain limit procedures which involve the multiparameter binomial inequalities, integral inequalities for continuous functions, and weighted norm inequalities for analytic functions. Some applications to the confluent hypergeometric functions, Bessel functions, Laguerre polynomials, and trigonometric functions are discussed. Also some generalizations are given.     

Unification of Filled Function and Tunnelling Function in Global Optimization

In this paper,two auxiliary functions for global optimization are proposed.These two auxiliaryfunctions possess all characters of tunnelling functions and filled functions under certain general assumptions.Thus,they can be considered as the unification of filled function and tunnelling function.Moreover,the processof tunneling or filling for global optimization can be unified as the minimization of such auxiliary functions.Result of numerical experiments shows that such two auxiliary functions are effective.     

强拟\alpha-预不变凸函数

研究了一类重要的广凸函数------强拟$\alpha$-预不变凸函数,讨论了它与拟\,$\alpha$-预不变凸函数、严格拟\,$\alpha$-预不变凸函数及半严格拟\,$\alpha$-预不变凸函数之间的关系,并在中间点的强拟\,$\alpha$-预不变凸性下得到了它的三个重要的性质定理,同时给出了强拟\,$\alpha$-预不变凸函 数在数学规划中的两个重要应用,这些结果在一定程度上完善了对强拟\,$\alpha$-预不变凸函数的研究.     

Near-Subconvexlikeness in Vector Optimization with Set-Valued Functions

A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization.     

Optimality and duality with generalized convexity

Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given.     

Implementation of Highly Accurate Complex Inclusion Functions in theCoStLy Library

Inclusion functions for complex standard functions have been implemented in the CoStLy C++ class library. Among other functions, CoStLy includes procedures for the exponential function, the logarithm, root and power functions, trigonometric and hyperbolic functions, and their inverse functions. Numerical examples are presented to demonstrate the high level of accuracy in computation that has been achieved with our implementation. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Optimization Properties of Functions, with a Concave Minorant

We give a definition of the class of functions with a concave minorant and compare these functions with other classes of functions often used in global optimization, e.g. weakly convex functions, d.c. functions, Lipschitzian functions, continuous and lower semicontinuous functions. It is shown that the class of functions with a concave minorant is closed under operations mainly used in optimization and how a concave minorant can be constructed for a given function.     

Filled functions for unconstrained global optimization

The paper is concerned with the filled functions for global optimization of a continuous function of several variables. More general forms of filled functions are presented for smooth and nonsmooth optimizations. These functions have either two adjustable parameters or one adjustable parameter. Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.