Value functions,domination cones and proper efficiency in multicriteria optimization

In the absence of a clear objective value function, it is still possible in many cases to construct a domination cone according to which efficient (nondominated) solutions can be found. The relations between value functions and domination cones and between efficiency and optimality are analyzed here. We show that such cones must be convex, strictly supported and, frequently, closed as well. Furthermore, in most applications potential optimal solutions are equivalent to properly efficient points. These solutions can often be produced by maximizing with respect to a class of concave functions or, under convexity conditions, a class of affine functions.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

Optimality for set functions with values in ordered vector spaces

Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() _D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.     

Convex programs with an additional reverse convex constraint

A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR ⁿ andf,g are convex finite functionsR ⁿ . Under suitable stability hypotheses, it is shown that a feasible point is optimal if and only if 0=max{g(x):xD,f(x)f( )}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ _k ,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS _k . The method is similar to the outer approximation method for maximizing a convex function over a compact convex set.     

Approximate first-order and second-order directional derivatives of a marginal function in convex optimization

Given a convex functionf: ^p × ^q (–, +], the marginal function is defined on ^p by (x)=inf{f(x, y)|y ^q }. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx ₀ in terms of those off at (x ₀,y ₀), wherey ₀ is any element for which (x ₀)=f(x ₀,y ₀).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1.     

A new approach for the derivation of bounds for the Jensen difference

There are many useful applications of Jensen's inequality in several fields of science, and due to this reason, a lot of results are devoted to this inequality in the literature. The main theme of this article is to present a new method of finding estimates of the Jensen difference for differentiable functions. By applying definition of convex function, and integral Jensen's inequality for concave function in the identity pertaining the Jensen difference, we derive bounds for the Jensen difference. We present integral version of the bounds in Riemann sense as well. The sharpness of the proposed bounds through examples are discussed, and we conclude that the proposed bounds are better than some existing bounds even with weaker conditions. Also, we present some new variants of the Hermite–Hadamard and Hölder inequalities and some new inequalities for geometric, quasi-arithmetic, and power means. Finally, we give some applications in information theory.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

CHAOS FOR MIXING TRANSFORMATIONS

ＣＨＡＯＳＦＯＲＭＩＸＩＮＧＴＲＡＮＳＦＯＲＭＡＴＩＯＮＳ￥ＬＩＡＯＧＯＮＧＦＵ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ,Ｃｈａｎｇｃｈｕｎ１３００２３,Ｃｈｉｎａ．）Ａｂｓｔｒａｃｔ：Ｆｏｒａｃｌａｓｓｏｆｍ...     

Banach spaces that admit support sets

It is shown that the existence of a closed convex set all of whose points are properly supported in a Banach space is equivalent to the existence of a certain type of uncountable ordered one-sided biorthogonal system. Under the continuum hypothesis, we deduce that this notion is weaker than the existence of an uncountable biorthogonal system.

     

SOME BLENDING INTERPOLATION METHODS IN CAGD

Some of the blending interpolation methods (which) stated by a convex combination technique are presented. This includes C1 ,C2 blending triangular interpolanls and C1 -blending quadrilateral inter polanls for surfaces. The mentioned methods can be generalized to the construction of C" blending interpolants.