Classes of Discrete Convexity Properties

In the general first-level classification of the convexity properties for sets, discrete convexities appear in more classes. A second-level classification identifies more subclasses containing discrete convexity properties, which appear as approximations either of classical convexity or of fuzzy convexity. First, we prove that all these convexity concepts are defined by segmental methods. The type of segmental method involved in the construction of discrete convexity determines the subclass to which it belongs. The subclasses containing the convexity properties that have discrete particular cases are also presented.     

A note on the convexity of lattices generated by the set of nonnegative integers

A class of lattices is said to be a convexity if it is closed under homomorphic images, convex sublattices and direct products. The main aim of this paper is to show that convexity generated by nonnegative integers contains all ordinal numbers. Consequently, any two infinite ordinals generate the same convexity.     

Convexity with respect to a differential equation

The concepts of convexity of a set, convexity of a function and monotonicity of an operator with respect to a second-order ordinary differential equation are introduced in this paper. Several well-known properties of usual convexity are derived in this context, in particular, a characterization of convexity of function and monotonicity of an operator. A sufficient optimality condition for a optimization problem is obtained as an application. A number of examples of convex sets, convex functions and monotone operators with respect to a differential equation are presented.     

Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems

A class of constrained multiobjective fractional programming problems is considered from a viewpoint of the generalized convexity. Some basic concepts about the generalized convexity of functions, including a unified formulation of generalized convexity, are presented. Based upon the concept of the generalized convexity, efficiency conditions and duality for a class of multiobjective fractional programming problems are obtained. For three types of duals of the multiobjective fractional programming problem, the corresponding duality theorems are also established.     

Convexity Conditions for Generalized Riemann Derivable Functions

Several convexity theorems for generalized Riemann derivative are obtained. A generalized symmetric derivative is introduced which includes the usual symmetric Riemann derivative and with the help of this generalized symmetric derivative several other convexity theorems are established. A partial answer to a conjecture of Butzer and Kozakiewicz is given.     

A generalized section theorem and a minimax inequality for a vector-valued mapping 1

A generalized Fan's section theorem has proposed by replacing convexity assumptions with merely topological properties. A generalized reformulation of Browder's fixed point theorem has derived. The Minimax Inequalities for vector-valued mapping in an ordered Banach space have established without the convexity and with convexity, respectively.     

Second-order subdifferentials and convexity of real-valued functions

In this paper we show that the positive semi-definiteness (PSD) of the Fréchet and/or Mordukhovich second-order subdifferentials can recognize the convexity of C¹ functions. However, the PSD is insufficient for ensuring the convexity of a locally Lipschitz function in general. A complete characterization of strong convexity via the second-order subdifferentials is also given.     

一个模糊凸性的新的证明

用一种新的更传统的方法证明了在下半连续的条件下模糊凸性的两个充分条件.证明充分利用了下半连续即有最小值这一引理,没有沿用讨论该类模糊凸性问题常用方法,将模糊凸性的研究与传统分析中的有关内容融合、统一起来,给该类模糊凸性的研究提供了一种新的思路.     

Convergence property of the Iri-Imai algorithm for some smooth convex programming problems

In this paper, the Iri-Imai algorithm for solving linear and convex quadratic programming is extended to solve some other smooth convex programming problems. The globally linear convergence rate of this extended algorithm is proved, under the condition that the objective and constraint functions satisfy a certain type of convexity, called the harmonic convexity in this paper. A characterization of this convexity condition is given. The same convexity condition was used by Mehrotra and Sun to prove the convergence of a path-following algorithm.The Iri-Imai algorithm is a natural generalization of the original Newton algorithm to constrained convex programming. Other known convergent interior-point algorithms for smooth convex programming are mainly based on the path-following approach.     

关于半连续函数与凸函数的注记

在半连续前提下,给出凸函数和严格凸函数的不等式刻划．指出非空凸集上的半连续函数满足中间点凸性时,成为凸函数,满足中间点严格凸性时,成为严格凸函数．最后定义F—G广义凸函数和条件p1,p2等概念,列举若干满足条件p1,p2的数量函数和向量函数,并指出,对于F—G广义凸函数,在条件p1,p2及一定连续性条件下,可以得到类似结果．     

The lattice of convexities of partial monounary algebras

A class of partial monounary algebras is called a convexity if it is closed under homomorphic images, direct products and convex relative subalgebras. We prove that the collection of all convexities of partial monounary algebras forms a countable set. Further, each convexity can be generated by at most two algebras.     

A NEW PROOF FOR THE CONVEXITY OF THE BERNSTEIN-BEZIER SURFACES OVER TRIANGLES

A neceassary and sufficient condition for the convexity of the Bezier net is presented'The convex Bezier net implies the convexity of the corresponding Bernstein-Bezier surfaceover triangles', a theorem established by Chang Geng-zhe and Philip J. Davis, is reprovedby a new approach.     

Generalized concavity and duality with a square root term

Duality results for a class of nondifferentiable mathematical programming problems are given. These results allow for the weakening of the usual convexity conditions required for duality to hold. A pair of symmetric and self dual nondifferentiable programs under weaker convexity conditions are also given. A subgradient symmetric duality is proposed and its limitations discussed. Finally, a pair of nondifferentiable mathematical programs containing arbitrary norms is presented.     

Best Approximation on Convex Sets in Metric Linear Spaces

In this paper the concepts of strictly convex and uniformly convex normed linear spaces are extended to metric linear spaces. A relationship between strict convexity and uniform convexity is established. Some existence and uniqueness theorems on best approximation in metric linear spaces under different conditions are proved.     

Graphs with intrinsic s3 convexities

Separation properties for some intrinsic convexities of graphs are investigated. The most natural convexities defined on a graph are the induced path convexity and the geodesic convexity. A set A of vertices is convex with respect to the former convexity if A contains every induced path connecting two vertices of A. In particular, a characterization of those graphs is given in which all such convex sets are the intersections of halfspaces (i.e., convex sets with convex complements).     

Preservation of convexity of solutions to parabolic equations

In the present paper we find necessary and sufficient conditions on the coefficients of a parabolic equation for convexity to be preserved. A parabolic equation is said to preserve convexity if given a convex initial condition, any solution of moderate growth remains a convex function of the spatial variables for each fixed time.     

Comments on abstract convexity structures on topological spaces

All results in “Some properties of abstract convexity structures on topological spaces” by S.-w. Xiang and H. Yang [S.-w. Xiang, H. Yang, Some properties of abstract convexity structures on topological spaces, Nonlinear Analysis 67 (2007) 803-808] and “A further characteristic of abstract convexity structures on topological spaces” by S.-w. Xiang and S. Xia [S.-w. Xiang, S. Xia, A further characteristic of abstract convexity structures on topological spaces, J. Math. Anal. Appl. 335 (2007) 716-723] are shown to be consequences of known ones or can be stated in more general forms.     

On multiple objective programming problems with set functions

The convexity of a subset of a σ-algebra and the convexity of a set function on a convex subset are defined. Related properties are also examined. A Farkas-Minkowski theorem for set functions is then proved. These results are used to characterize properly efficient solutions for multiple objective programming problems with set functions by associated scalar problems.     

半模糊凸模糊映射

In this paper, a new class of fuzzy mappings called semistrictly convex fuzzy mappings is introduced and we present some properties of this kind of fuzzy mappings. In particular, we prove that a local minimum of a semistrictly convex fuzzy mapping is also a global minimum. We also discuss the relations among convexity, strict convexity and semistrict convexity of fuzzy mapping, and give several sufficient conditions for convexity and semistrict convexity.     

关于广义Muirhead平均的Schur幂凸性

对广义Muirhead平均的Schur-幂凸性进行了讨论,给出了判定Muirhead平均的Schur-幂凸性的充要条件.结果改进了Chu和Xia在相关文献中的主要结果,Chu和Xia的结果是结果的特例.