半严格-G-半预不变凸性与最优化

提出了一类新的广义凸函数——半严格-G-半预不变凸函数,它是一类重要的广义凸函数,是半严格预不变凸函数和半严格-G-预不变凸函数的真推广．首先,用例子说明了半严格-G-半预不变凸函数的存在性,并给出例子说明它是与G-半预不变凸函数不同的一类函数;然后,给出了半严格-G-半预不变凸函数的几个基本性质;最后,讨论了半严格-G-半预不变凸函数分别在无约束和带不等式约束的非线性规划问题中的应用,得到了一些最优性结果,并举例验证所得结论的正确性．     

半严格不变凸函数

文章在Banach空间中定义了一种新的广义凸函数—半严格不变凸函数.对于满足局部Lipschitz条件的半严格不变凸函数,得到了它的广义Clarke次微分性质.文中还讨论了半严格不变凸函数与不变凸函数及半严格预不变凸函数之间的关系,得到了半严格不变凸函数的一些性质.     

半严格不变凸函数

文章在Banach空间中定义了一种新的广义凸函数—半严格不变凸函数.对于满足局部Lipschitz条件的半严格不变凸函数,得到了它的广义Clarke次微分性质.文中还讨论了半严格不变凸函数与不变凸函数及半严格预不变凸函数之间的关系,得到了半严格不变凸函数的一些性质.     

强预拟不变凸函数的充要条件

本文引入了一类新的广义凸函数—强预拟不变凸函数.讨论了强预拟不变凸函数与预拟不变凸函数、严格预拟不变凸函数及半严格预拟不变凸函数之间的关系,得到它的三个充要条件:(i)当条件P_1满足时,f是强预拟不变凸函数的充分必要条件是f是预拟不变凸函数且f满足中间点强预拟不变凸性;(ii)当条件P_2满足时,f是强预拟不变凸函数的充分必要条件是f是严格预拟不变凸函数且f满足中间点强顶拟不变凸性;(iii)当条件P_2满足时,f是强预拟不变凸函数的充分必要条件是f是半严格预拟不变凸函数且f满足中间点强预拟不变凸性.     

强拟α-预不变凸函数

研究了一类重要的广凸函数——强拟α-预不变凸函数,讨论了它与拟α-预不变凸函数、严格拟α-预不变凸函数及半严格拟α-预不变凸函数之间的关系,并在中间点的强拟α-预不变凸性下得到了它的三个重要的性质定理,同时给出了强拟α-预不变凸函数在数学规划中的两个重要应用,这些结果在一定程度上完善了对强拟α-预不变凸函数的研究.     

向量D-η-E-半预不变凸映射与向量优化

提出了一类新的向量值映射——D-η-E-半预不变凸映射,它是E-预不变凸映射与D-η-半预不变凸映射的真推广.首先,用例子说明了E-半不变凸集、D-η-E-半预不变凸映射的存在性;然后,给出了D-η-E-半预不变凸映射的判定定理,并讨论了D-η-E-半预不变凸映射与D-η-E-严格/半严格半预不变凸映射的关系;最后,得到了D-η-E-半严格半预不变凸映射在隐约束优化问题中的一个重要应用,并举例验证了所得结果.     

严格r-预不变凸函数

引入了严格r-预不变凸函数的概念,并证明了严格r-预不变凸函数与r-预不变凸函数有关的一个充分条件．同时,讨论得到了严格r-预不变凸性和半严格r-预不变凸性的等价条件．     

强拟\alpha-预不变凸函数

研究了一类重要的广凸函数------强拟$\alpha$-预不变凸函数,讨论了它与拟\,$\alpha$-预不变凸函数、严格拟\,$\alpha$-预不变凸函数及半严格拟\,$\alpha$-预不变凸函数之间的关系,并在中间点的强拟\,$\alpha$-预不变凸性下得到了它的三个重要的性质定理,同时给出了强拟\,$\alpha$-预不变凸函 数在数学规划中的两个重要应用,这些结果在一定程度上完善了对强拟\,$\alpha$-预不变凸函数的研究.     

强预不变凸函数的充要条件

本文讨论了强预不变凸函数与预不变凸函数、严格预不变凸函数及半严格预不变凸函数之间的关系,得到它的三个充要条件：(i)在一定条件下,f是强预不变凸函数的充分必要条件是f是预不变凸函数且f满足中间点强预不变凸性；(ii)在一定条件下,f是强预不变凸函数的充分必要条件是f是严格预不变凸函数且f满足中间点强预不变凸性；(iii)在一定条件下,f是强预不变凸函数的充分必要条件是f是半严格预不变凸函数且f满足中间点强预不变凸性．     

D-η-E-半预不变凸映射和D-η-E-半预不变真拟凸映射

研究了D-η-E-半预不变凸映射和D-η-E-半预不变真拟凸映射的一些性质.首先,讨论了D-η-E-半预不变凸与D-η-E-严格半预不变真拟凸、D-η-E-半严格半预不变真拟凸和D-η-E-半预不变真拟凸之间的关系,在中间点的D-η-E-半预不变凸性和其他一些条件下,得到了它的3个重要的性质定理;其次,对D-η-E-半预不变真拟凸与D-η-E-半严格半预不变真拟凸和D-η-E-严格半预不变真拟凸之间的关系也进行了讨论;最后,获得了D-η-E-半预不变真拟凸映射在优化中的一个重要应用.     

On quasi $$\epsilon $$-solution for robust convex optimization problems

This paper devotes to the quasi \(\epsilon \)-solution (one sort of approximate solutions) for a robust convex optimization problem in the face of data uncertainty. Using robust optimization approach (worst-case approach), we establish approximate optimality theorem and approximate duality theorems in term of Wolfe type on quasi \(\epsilon \)-solution for the robust convex optimization problem. Moreover, some examples are given to illustrate the obtained results.     

局部凸空间上的泛函的非光滑分析及多目标规划

该文对定义于局部凸线性拓扑空间Ｘ上的泛函引入广义方向导数、广义梯度及满足Ｌｉｐｓ－ｃｈｉｔｚ条件等概念,证明了它们的几个重要性质,并举例说明这里满足Ｌｉｐｓｃｈｉｔｚ条件的概念是Ｂａ－ｎａｃｈ空间情形的严格推广．最后,作为上述结论及方法的应用,讨论定义于Ｘ的多目标数学规划,得出若干关于弱有效解的最优性条件．     

Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems

This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are interested in some various lower level constraint qualifications for the problem. Then, the results are used to establish efficient upper estimate of certain subdifferential of value functions. Finally, we apply the obtained subdifferential estimates to derive necessary optimality conditions for the problem.     

Optimality and duality with generalized convexity

Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given.     

限制同时Chebyshev逼近

设T是紧Hausdorff空间,C(T)表示定义在T上的实值连续函数全体.对f∈C(T),定义 ||f||=max|f(t)|,则C(T)是Banach空间。再设λ_i>0(i=1,2,…,m),sum from i=1 to m(λ_i)=1,(1≤m≤+∞,1≤p<+∞),令     

一类多目标Lipschitz规划的对偶定理

Lipschitz函数定义了广义本性伪凸的概念,建立了多目标Lipschitz规划的Mond-Weir型对偶和Wolfe型对偶,证明了原规划与对偶规划之间的对偶定理。     

Improved delay-dependent stability criterion for neural networks with time-varying delay

In this paper, the problem of delay-dependent asymptotic stability criterion for neural networks with time-varying delay has been considered. A new class of Lyapunov functional which contains a triple-integral term is constructed to derive some new delay-dependent stability criteria. The obtained criteria are less conservative because free-weighting matrices method and a convex optimization approach are considered. Finally, numerical examples are given to illustrate the effectiveness of the proposed method.     

An outcome space approach for generalized convex multiplicative programs

This paper addresses the problem of minimizing an arbitrary finite sum of products of two convex functions over a convex set. Nonconvex problems in this form constitute a class of generalized convex multiplicative problems. Convex analysis results allow to reformulate the problem as an indefinite quadratic problem with infinitely many linear constraints. Special properties of the quadratic problem combined with an adequate outer approximation procedure for handling its semi-infinite constrained set enable an efficient constraint enumeration global optimization algorithm for generalized convex multiplicative programs. Computational experiences illustrate the proposed approach.     

具有(F,α,ε)-G凸的分式半无限规划问题的ε-最优性

首次引入了（F,α,ε）-G凸函数,（F,α,ε）-G拟凸函数和（F,α,ε）-G伪凸函数等概念,对已有的凸函数进行了推广,研究了涉及这类函数的一类分式半无限规划的ε-最优性条件,得到了一些有意义的结果．这些结果不仅是现有某些结果的推广,而且为诸如资源分配,投资组合等问题的研究提供了依据,也为理论上研究分式规划提供了参考．