非凸集值映射的包含切性及应用

本文在一般的Ｂａｎａｃｈ空间Ｘ中研究从非空闭集ＫＸ到Ｘ的非凸集值映射Ｆ的包含切性问题．得到的结果定理３．１把有关的结论推广到非光滑空间，定理３．３则将有限维空间的正则性定理推广到任意的Ｂａｎａｃｈ空间．作为结果的应用，我们证明了无穷维非凸微分包含和非凸控制系统生存解的存在性，且给出了一个方便的等价切性条件．     

微分包含生存解集的拓扑性质

本文证明了有限维空间中微分包含系统的生存解集是一个Rδ-集，并将结果推广至无限维空间．     

闭凸集上的一类非线性半变分不等式解的存在性

考虑一类定义在闭凸集上的非线性半变分不等式问题,通过运用闭凸集上的临界点理论、Clarke次微分性质以及非光滑紧性条件等,得到了这类半变分不等式解的存在性．     

Banach空间上凸集的凸性

以Banach空间的一般凸集为研究对象,将Banach空间的凸性研究推广到了内部非空的凸集上．打破了从单位球出发研究Banach空间几何的具有局限性的研究方法,给出了严格凸集的若干特征刻画及性质,并得到了严格凸集和光滑集之间的对偶定理．     

Hilbert空间中的非扩张映象的不动点集的结构及其迭代集合序列逼近

我们研究Hilbert空间H中的闭凸集C上的非扩张映象T的不动点集F(T)的结构和它的集合序列逼近。我们得到 1 不动点集F(T)是闭的和凸的; 2 提供一个集合序列迭代法,使得由这个方法构造的迭代集合序列在某些条件和某种意义下强(弱)收敛于T的一个不动点,并给出收敛速度估计。 前面叙述的这些结果包含了Browder,Petryshyn,Kirk等人的某些结果。     

Banach空间中一类具阻尼的二阶微分包含的可控性

主要研究了Banach空间一类具有阻尼项的二阶微分包含的可控性,利用集值映射不动点定理,讨论了集值函数取凸值的情况,给出了微分包含可控性的充分条件.     

半非紧测度与集值AM映象

本文以半非紧测度为工具研究一类非线性集值映象的性质，然后把所得结果用于证明微分包含的解的存在性     

近似凸集的某些性质

主要研究了两类近似凸集的关系和性质.首先,举例说明两类近似凸集没有相互包含关系.其次,在近似凸集(nearly convex)条件下,证明了在一定条件下函数上图是近似凸集与凸集的等价关系.同时,考虑了近似凸函数与函数上图是近似凸集的等价刻画、近似凸函数与函数水平集是近似凸集的必要性,并用例子说明近似凸函数与函数水平集是...     

Banach空间中具约束的泛函微分包含

本文研究无限维空间中具约束的泛函微分包含，证明了闭生存集时的生存定理，推广了已有的若干结论，并部分地回答了一个公开问题．     

含有非线性半群的非凸值泛函微分包含

本文研究Banach空间中含有非线性半群的非凸值泛函微分包含，证明了积分解的存在性，得到一个新的存在性定理．     

一类非凸不可微规划的算法

讨论一类带非凸不可微函数约束的非凸不可微规划的求解,提出一种基于分枝定界技巧的算法,该算法具有全局收敛性．     

Relaxation of Nonlocal Singular Integrals

In this paper we study well-posedness of a class of nonconvex variational principles arising in regularization theory for denoising of data with sampling errors and level set regularization methods for inverse problems. These models result in minimization of nonconvex, singular functionals involving (possibly) non-local operators.     

Pareto Optimality in Nonconvex Economies with Infinite-dimensional Commodity Spaces

The paper contains applications of variational analysis to the study of Pareto optimality in nonconvex economies with infinite-dimensional commodity spaces satisfying the Asplund property. Our basic tool is a certain extremal principle that provides necessary conditions for set extremality and can be treated as a variational extension of the classical convex separation principle to systems of nonconvex sets. In this way we obtain new versions of the generalized second welfare theorem for nonconvex economies in terms of appropriate normal cones of variational analysis.     

Stability and augmented Lagrangian duality in nonconvex semi-infinite programming

In this paper the pseudo-Lipschitz property of the constraint set mapping and the Lipschitz property of the optimal value function of parametric nonconvex semi-infinite optimization problems are obtained under suitable conditions on the limiting subdifferential and the limiting normal cone. Then we derive sufficient conditions for the strong duality of nonconvex semi-infinite optimality problems and a criterion for exact penalty representations via an augmented Lagrangian approach. Examples are given to illustrate the obtained results.     

On the set of solutions of some nonconvex nonclosed hyperbolic differential inclusions

We consider a class of nonconvex and nonclosed hyperbolic differential inclusions and we prove the arcwise connectedness of the solution set.     

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations.     

Construction of the Solvability Set in Differential Games with Simple Motion and Nonconvex Terminal Set

We consider planar zero-sum differential games with simple motion, fixed terminal time, and polygonal terminal set. The geometric constraint on the control of each player is a convex polygonal set or a line segment. In the case of a convex terminal set, an explicit formula is known for the solvability set (a level set of the value function, maximal u-stable bridge, viability set). The algorithm corresponding to this formula is based on the set operations of algebraic sum and geometric difference (the Minkowski difference). We propose an algorithm for the exact construction of the solvability set in the case of a nonconvex polygonal terminal set. The algorithm does not involve the additional partition of the time interval and the recovery of intermediate solvability sets at additional instants. A list of half-spaces in the three-dimensional space of time and state coordinates is formed and processed by a finite recursion. The list is based on the polygonal terminal set with the use of normals to the polygonal constraints on the controls of the players.     

On Duality for a Class of Quasiconcave Multiplicative Programs

Multiplicative programs are a difficult class of nonconvex programs that have received increasing attention because of their many applications. However, given their nonconvex nature, few theoretical results are available. In this paper, we study a particular case of these programs which involves the maximization of a quasiconcave function over a linear constraint set. Using results from conjugate function theory and generalized geometric programming, we derive a complete duality theory. The results are further specialized to linear multiplicative programming.     

A generalized duality and applications

The aim of this paper is to present a nonconvex duality with a zero gap and its connection with convex duality. Since a convex program can be regarded as a particular case of convex maximization over a convex set, a nonconvex duality can be regarded as a generalization of convex duality. The generalized duality can be obtained on the basis of convex duality and minimax theorems. The duality with a zero gap can be extended to a more general nonconvex problems such as a quasiconvex maximization over a general nonconvex set or a general minimization over the complement of a convex set. Several applications are given.On leave from the Institute of Mathematics, Hanoi, Vietnam.