On some length problems for univalent functions

Let be the class of functions which are analytic in the unit disk . Let C(r) be the closed curve that is the image of the circle |z|=r < 1 under the mapping w = f(z), L(r) the length of C(r), and let A(r) be the area enclosed by the curve C(r). In 1968 D. K. Thomas shown that if , f is starlike with respect to the origin, and for 0≤r < 1, A(r) < A, an absolute constant, then Later, in 1969 Nunokawa has shown that if f is convex univalent, then This paper is devoted to obtaining a related correspondence between f(z) and L(r) for the case when f is univalent. Copyright © 2016 John Wiley & Sons, Ltd.     

Generalized convex functions and vector variational inequalities

In this paper, (, ,Q)-invexity is introduced, where :X ×X intR _m ⁺ , :X ×X X,X is a Banach space,Q is a convex cone ofR ^m . This unifies the properties of many classes of functions, such asQ-convexity, pseudo-linearity, representation condition, null space condition, andV-invexity. A generalized vector variational inequality is considered, and its equivalence with a multi-objective programming problem is discussed using (, ,Q)-invexity. An existence theorem for the solution of a generalized vector variational inequality is proved. Some applications of (, ,Q)-invexity to multi-objective programming problems and to a special kind of generalized vector variational inequality are given.The author is indebted to Dr. V. Jeyakumar for his constant encouragement and useful discussion and to Professor P. L. Yu for encouragement and valuable comments about this paper.     

On the continuity of biconjugate convex functions

We show that a Banach space is a Grothendieck space if and only if every continuous convex function on has a continuous biconjugate function on , thus also answering a question raised by S. Simons. Related characterizations and examples are given.

     

On Minimizing and Stationary Sequences of a New Class of Merit Functions for Nonlinear Complementarity Problems

Motivated by the work of Fukushima and Pang (Ref. 1), we study the equivalent relationship between minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems (NCP). These merit functions generalize that obtained via the squared Fischer–Burmeister NCP function, which was used in Ref. 1. We show that a stationary sequence {x^k} /Reⁿ is a minimizing sequence under the condition that the function value sequence {F(x ^k)} is bounded above or the Jacobian matrix sequence {F(x ^k)} is bounded, where F is the function involved in NCP. The latter condition is also assumed by Fukushima and Pang. The converse is true under the assumption of {F(x ^k)} bounded. As an example shows, even for a bounded function F, the boundedness of the sequence {F(x ^k)} is necessary for a minimizing sequence to be a stationary sequence.     

Some characterizations of duality for DC optimization with composite functions

In this paper, by virtue of the epigraph technique, we first introduce some new regularity conditions and then obtain some complete characterizations of the Fenchel–Lagrange duality and the stable Fenchel–Lagrange duality for a new class of DC optimization involving a composite function. Moreover, we apply the strong and stable strong duality results to obtain some extended (stable) Farkas lemmas and (stable) alternative type theorems for this DC optimization problem. As applications, we obtain the corresponding results for a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator, respectively.     

Penalty function theory for general convex programming problems

A class of penalty functions for solving convex programming problems with general constraint sets is considered. Convergence theorems for penalty methods are established by utilizing the concept of infimal convergence of a sequence of functions. It is shown that most existing penalty functions are included in our class of penalty functions.     

On conditions for optimality of a class of nondifferentiable functions

The purpose of this paper is to derive first-order necessary conditions for optimality of a class of nondifferentiable functions. The first-order necessary conditions for optimality for the minimax function and thel ₁-function can be considered as special cases of the present method. Furthermore, the optimality conditions obtained are used to obtain threshold values for the controlling parameters of a class of exact penalty functions.     

On the functions with pseudoconvex sublevel sets and optimality conditions

A new class of generalized convex functions, called the functions with pseudoconvex sublevel sets, is defined. They include quasiconvex ones. A complete characterization of these functions is derived. Further, it is shown that a continuous function admits pseudoconvex sublevel sets if and only if it is quasiconvex. Optimality conditions for a minimum of the nonsmooth nonlinear programming problem with inequality, equality and a set constraints are obtained in terms of the lower Hadamard directional derivative. In particular sufficient conditions for a strict global minimum are given where the functions have pseudoconvex sublevel sets.     

Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

We consider a convex optimization problem with a vector valued function as objective function and convex cone inequality constraints. We suppose that each entry of the objective function is the composition of some convex functions. Our aim is to provide necessary and sufficient conditions for the weakly efficient solutions of this vector problem. Moreover, a multiobjective dual treatment is given and weak and strong duality assertions are proved.      

On topological types of ordered median functions

An ordered median functions is a continuous piecewise-linear function. It is well known that in finite dimensional spaces every continuous piecewise-linear function admits a max-min representation in terms of its linear functions. An explicit representation of an ordered median function in max-min form is given by the authors and will appear in a forthcoming issue of this journal. Based on this representation, we give a topological classification of ordered median functions through their simplicial complex of ascent (resp. descent) cones.     

带有极值函数的多目标双层规划问题的对偶

For a multiobjective bilevel programming problem(P) with an extremal-value function,its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved.Under some convexity and monotonicity assumptions,the weak and strong duality assertions are obtained.     

Subdifferential formulas for a class of non-convex infimal convolutions

In this paper, we provide a number of subdifferential formulas for a class of non-convex infimal convolutions in normed spaces. The formulas obtained unify several results on subdifferentials of the distance function and the minimal time function. In particular, we generalize the results obtained recently by Zhang et al.     

关于Smarandache对偶函数

定义Smarandache对偶函数S*(n)为最大的正整数m使得m!|n.定义另一种双阶乘函数S**(n)为最大的正整数2m-1使得(2m-1)!!|n,其中2 n;且当2|n时,为最大的正整数2m使得(2m)!!|n.本文的主要目的是利用初等方法研究一个包含S**(n)的无穷级数的收敛性,并给出一个有趣的恒等式.     

On pseudolinear functions

In this paper the structure of a smooth pseudolinear function is investigated and the general form of the gradient is given explicitly.     

On generalized means and generalized convex functions

Properties of generalized convex functions, defined in terms of the generalized means introduced by Hardy, Littlewood, and Polya, are easily obtained by showing that generalized means and generalized convex functions are in fact ordinary arithmetic means and ordinary convex functions, respectively, defined on linear spaces with suitably chosen operations of addition and multiplication. The results are applied to some problems in statistical decision theory.This research was supported by Project No. NR-047-021, Contract No. N00014-75-C-0569 with the Center for Cybernetic Studies, The University of Texas, Austin, Texas, and by NSF Grant No. ENG-76-10260 at Northwestern University, Evanston, Illinois.     

Relations between Lipschitz functions and convex functions

We discuss the relationship between Lipschitz functions and convex functions. By these relations, we give a sufficient condition for the set of points where Lipschitz functions on a Hilbert space is Frechet differentiate to be residual.     

A subclass of parabolic starlike and uniformly convex functions

Let A be the class of analytic functions in the open unit disk U. A function f in A satisfying the normalization is said to be in the class SP_n if Dⁿf is a parabolic starlike function, where Dⁿ is a notation of the Salagean operator. In this paper, several basic properties and characteristics of the class SP_n are investigated. These include subordination, convolution properties, class-preserving integral operators, and Fekete-Szegö problems.     

On interpolation with products of positive definite functions

In this paper we consider the problem of scattered data interpolation for multivariate functions. In order to solve this problem, linear combinations of products of positive definite kernel functions are used. The theory of reproducing kernels is applied. In particular, it follows from this theory that the interpolating functions are solutions of some varational problems.     

Generalization of preinvex and B-vex functions

A class of functions called B-preinvex functions is introduced by relaxing the definitions of preinvex and B-vex functions. Examples are given to show that there exist functions which are B-preinvex but not preinvex or B-vex or quasipreinvex. Some of the properties of B-preinvex functions are obtained.The contribution of this author was made partially at University of Manitoba and partially at St. Lawrence University during the summer of 1990. Support for the visit to St. Lawrence University was made possible under the GTE/SLU Visiting Scholars Grant.     

On the interplay between the Hilbert transform and conjugate harmonic functions

As is well‐known, there is a close and well‐defined connection between the notions of Hilbert transform and of conjugate harmonic functions in the context of the complex plane. This holds e.g. in the case of the Hilbert transform on the real line, which is linked to conjugate harmonicity in the upper (or lower) half plane. It also can be rephrased when dealing with the Hilbert transform on the boundary of a simply connected domain related to conjugate harmonics in its interior (or exterior). In this paper, we extend these principles to higher dimensional space, more specifically, in a Clifford analysis setting. We will show that the intimate relation between both concepts remains, however giving rise to a range of possibilities for the definition of either new Hilbert‐like transforms, or specific notions of conjugate harmonicity. Copyright © 2006 John Wiley & Sons, Ltd.