Locally uniformly rotund points in convex-transitive Banach spaces

Almost transitive superreflexive Banach spaces have been considered in [C. Finet, Uniform convexity properties of norms on superreflexive Banach spaces, Israel J. Math. 53 (1986) 81–92], where it is shown that they are uniformly convex and uniformly smooth. We characterize such spaces as those convex transitive Banach spaces satisfying conditions much weaker than that of uniform convexity (for example, that of having a weakly locally uniformly rotund point). We note that, in general, the property of convex transitivity for a Banach space is weaker than that of almost transitivity.     

Collapsible polyhedra and median spaces

It is shown that a collapsible, compact, connected, simplicial polyhedron admits a cubical subdivision and a median convexity, such that all cubes are convex subspaces with a convexity of subcubes. Conversely, a compact, connected, cubical polyhedron with a convexity as described admits a collapsible simplicial subdivision. Such a convexity, when it exists, is uniquely determined by the corresponding cubical presentation. Some related open problems have been formulated.

     

Strong Restricted-Orientation Convexity

Strong restricted-orientation convexity is a generalization of standard convexity. We explore the properties of strongly convex sets in multidimensional Euclidean space and identify major properties of standard convex sets that also hold for strong convexity. We characterize strongly convex flats and halfspaces, and establish the strong convexity of the affine hull of a strongly convex set. We then show that, for every point in the boundary of a strongly convex set, there is a supporting strongly convex hyperplane through it. Finally, we show that a closed set with nonempty interior is strongly convex if and only if it is the intersection of strongly convex halfspaces; we state a condition under which this result extends to sets with empty interior.     

Submanifolds in the Context of Infinite Dimensional Manifolds with Corners

In this paper we introduce new definitions of submanifold and immersion in the context of infinite dimensional manifolds with corners. We show that they are the natural concepts in this context by giving positive answers to the problems of transitivity of submanifolds, inverse image of submanifolds and transversality, the problem of good immersion in quadrants of Banach spaces and the relation between a map being differentiable and its graph being a submanifold.     

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.     

半模糊凸模糊映射

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.     

DEA with efficiency classification preserving conditional convexity

We propose to relax the standard convexity property used in Data Envelopment Analysis (DEA) by imposing additional qualifications for feasibility of convex combinations. We specifically focus on a condition that preserves the Koopmans efficiency classification. This yields an efficiency classification preserving conditional convexity property, which is implied by both monotonicity and convexity, but not conversely. Substituting convexity by conditional convexity, we construct various empirical DEA approximations as the minimal sets that contain all DMUs and are consistent with the imposed production assumptions. Imposing an additional disjunctive constraint to standard convex DEA formulations can enforce conditional convexity. Computation of efficiency measures relative to conditionally convex production set can be performed through Disjunctive Programming (DP).     

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).     

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

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

凸性与度量投影的连续性

本文研究近强凸、近非常凸Banach空间中度量投影的连续性。获得如下结果：若A是近强凸（近非常凸）空间中的逼近凸集,则度量投影PA是范-范上半连续的（范-弱上半连续的）。此外,我们还利用度量投影的连续性给出Banach空间为近强凸、近非常凸的一些充分必要条件。     

Convergence analysis of a proximal point algorithm for minimizing differences of functions

Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A significant progress to go beyond convexity was made by considering the class of functions representable as differences of convex functions. In this paper, we introduce a generalized proximal point algorithm to minimize the difference of a nonconvex function and a convex function. We also study convergence results of this algorithm under the main assumption that the objective function satisfies the Kurdyka–?ojasiewicz property.     

Surfaces in Euclidean 3-space whose normal bundles are tangentially biharmonic

A submanifold is said to be tangentially biharmonic if the bitension field of the isometric immersion that defines the submanifold has vanishing tangential component. The purpose of this paper is to prove that a surface in Euclidean 3-space has tangentially biharmonic normal bundle if and only if it is either minimal, a part of a round sphere, or a part of a circular cylinder.     

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.     

局部凸空间的k-一致极凸性与k-一致极光滑性

首先引入局部凸空间的k-一致极凸性和k-一致极光滑性这一对对偶概念,它们既是Banach空间k-一致极凸性和k-一致极光滑性推广,又是局部凸空间一致极凸性和一致极光滑性的自然推广.其次讨论它们与其它k-凸性(k-光滑性)之间的关系.最后,在P-自反的条件下给出它们之间的等价对偶定理.     

Remarks on strongly convex functions

Some properties of strongly convex functions are presented. A characterization of pairs of functions that can be separated by a strongly convex function and a Hyers?CUlam stability result for strongly convex functions are given. An integral Jensen-type inequality and a Hermite?CHadamard-type inequality for strongly convex functions are obtained. Finally, a relationship between strong convexity and generalized convexity in the sense of Beckenbach is shown.     

A decomposition theorem for convexity spaces

We utilize the unifying framework of families of convexity spaces for the treatment of various notions of planar convexity and the associated convex hulls. Our major goal is to prove the refinement and decomposition theorems for families of convexity spaces. These general theorems are then applied to two examples: restricted-oriented convex sets andNESW-convex sets. The applications demonstrate the usefulness of these general theorems, since they give rise to simple algorithms for the computation of the associated convex hulls of polygons.     

Support-type properties of generalized convex functions

Chebyshev systems induce in a natural way a concept of convexity. The functions convex in this sense behave in many aspects similarly to ordinary convex functions. In this paper support-type properties are investigated. Using osculatory interpolation, the existence of support-like functions is established for functions convex with respect to Chebyshev systems. Unique supports are determined. A characterization of the generalized convexity via support properties is presented.     

Applications of symmetric derivatives in mathematical programming

In recent times the Kuhn—Tucker optimality conditions and the duality theorems for convex programming have been extended by generalizations of the convexity concept. In this paper the notion of a symmetric derivative for a function of several variables is introduced and used to provide extensions of some fundamental optimality and duality theorems of convex programming. Symmetric derivatives are also used to extend some optimality and duality theorems involving pseudoconvexity and differentiable quasiconvexity.     

基于凸函数的风险测度

利用凸函数构造了一种新的风险测度,发现它是包含了损失概率、损失期望值、绝对离差、绝对半离差,下偏矩、(α,t)模型、ES等常见方法的更为广泛的风险测度.对其性质的研究发现该风险测度满足凸性和协调性,考虑到凸性以及协调性在投资组合以及风险管理中的重要意义,因此对该风险测度的研究就具有一定的实践和学术价值.     

On caustics of submanifolds and canal hypersurfaces in Euclidean space

We investigate a relationship between the caustics of a submanifold of general dimension and of a canal hypersurface of the submanifold in Euclidean space. As a consequence, these caustics are the same. Moreover, induced Lagrangian immersion germs are Lagrangian equivalent under a suitable condition. In order to show the results, we use the theory of Lagrangian singularity and of Legendrian singularity.