On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Minimax Results and Finite-Dimensional Separation

In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent.     

Nonnegative curvature and cobordism type

We show that in each dimension n = 4k, k≥ 2, there exist infinite sequences of closed simply connected Riemannian n-manifolds with nonnegative sectional curvature and mutually distinct oriented cobordism type. W. Tuschmann’s research was supported in part by a DFG Heisenberg Fellowship.     

Stone代数的Cayley表示定理

首先通过集代数得到了Stone代数的表示定理,然后证明了每一个Stone代数均嵌入到某个集合X上的一个Stone映射类S中.     

Generalized KKM Type Theorems in FC-Spaces with Applications (I)

The class KKM(X,Y) (resp., s-KKM(X,Y,Z)) of set-valued mappings with KKM (resp., s-KKM) property is introduced in FC-spaces without any convexity structure. Some generalized KKM (resp., s-KKM) type theorems are proved in FC-spaces under much weak assumptions. As applications, some new section theorems and coincidence theorems are established in FC-spaces. These theorems generalize many known results in literature. The further applications of these results will be given in a follow-up paper.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

An existence theorem for neutral variational problems of Bolza

This note proves an existence theorem for a generalized Bolza-type problem that has time delays in both the state and velocity variables. The assumptions are stated in terms of a modification of the classical Hamiltonian, and extend ideas of Rockafellar to the delay case.     

The Module Structure Theorem for Sobolev Spaces on Open Manifolds

We prove a general embedding theorem for Sobolev spaces on open manifolds of bounded geometry and infer from this the module structure theorem. Thereafter we apply this to weighted Sobolev spaces.