In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under ...In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.展开更多
Generation of mouse models carrying a defined point mutation,especially disease-related point mutations,is of considerable interest for research in biology and medicine.The standard method based on embryonic stem cell...Generation of mouse models carrying a defined point mutation,especially disease-related point mutations,is of considerable interest for research in biology and medicine.The standard method based on embryonic stem cell（ESC）-mediated homologous recombination（HR）is time-and labor-consuming.展开更多
This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex func...This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex function pairs,called type-I functions and pseudo-quasi-type-I functions,are introduced in this paper for(NUMFP).Under the assumption that(NUMFP)satisfies the robust constraint qualification with respect to Clarke subdifferential,necessary optimality conditions of the robust weak efficient solution are given.Sufficient optimality conditions are obtained under pseudo-quasi-type-I generalized convexity assumption.Furthermore,we introduce the concept of robust weak saddle points to(NUMFP),and prove two theorems about robust weak saddle points.The main results in the present paper are verified by concrete examples.展开更多
Let （E,ξ）=ind（En,ξn） be an inductive limit of a sequence （En,ξn）n∈N of locally convex spaces and let every step （En,ξn） be endowed with a partial order by a pointed convex （solid） cone Sn. In the framew...Let （E,ξ）=ind（En,ξn） be an inductive limit of a sequence （En,ξn）n∈N of locally convex spaces and let every step （En,ξn） be endowed with a partial order by a pointed convex （solid） cone Sn. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence （Sn）n∈N of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.展开更多
In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded bas...This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded base, then for every nonempty weakly compact convex subset A, the set of positive proper efficient points of A is dense in the set of efficient points of A.展开更多
There is a transition region between objects and background in any gray image. Many valuable applications of image segmentation and edge detection based on transition region determination have been developed in recent...There is a transition region between objects and background in any gray image. Many valuable applications of image segmentation and edge detection based on transition region determination have been developed in recent years. But, the complexity of calculation for determining transition region is too high. It results in the very limitation of applications based on transition region. A new novel fast method for transition region determination is presented in this paper, which will reduce the complexity of calculation dramatically. Many experiments have showed that this algorithm is effective and correct and will lay a good foundation for applications based on transition region. Key words image segmentation - transition region - maximum point - efficient average gradient (EAG) CLC number TP 391.4 Biography: Zhang Ai-hua (1965-), male, Ph. D candidate, research direction: image processing.展开更多
In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is co...In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.展开更多
In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modif...In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.展开更多
基金Foundation item： Supported by the Natural Science Foundation of China（10871216） Supported by the Natural Science Foundation Project of CQ CSTC（2008BB0346, 2007BB0441） Supported by the Excellent Young Teachers Program of Chongqing Jiaotong University（EYT08-016） Acknowledgement The author would like to thank the anonymous referee for the valuable remarks that helped considerably to correct and to improve the presentation.
文摘In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.
基金supported by the Ministry of Science and Technology of China (2014CB964803 and 2015AA020307)the National Natural Science Foundation of China (Nos. 31530048, 31601163 and 81672117)+1 种基金he Chinese Academy of Sciences (XDB19010204 and QYZDJ-SSW-SMC023)the Shanghai Municipal Commission for Science and Technology(16JC1420500, 17JC1400900 and 17140901500)
文摘Generation of mouse models carrying a defined point mutation,especially disease-related point mutations,is of considerable interest for research in biology and medicine.The standard method based on embryonic stem cell（ESC）-mediated homologous recombination（HR）is time-and labor-consuming.
基金supported by Natural Science Foundation of China(Nos.11861002 and 12171601)the Key Project of North Minzu University(No.ZDZX201804)+1 种基金the Construction Project of First-Class Disciplines in Ningxia Higher Education(NXYLXK2017B09)the Postgraduate Innovation Project of North Minzu Universit(No.YCX21157)..
文摘This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex function pairs,called type-I functions and pseudo-quasi-type-I functions,are introduced in this paper for(NUMFP).Under the assumption that(NUMFP)satisfies the robust constraint qualification with respect to Clarke subdifferential,necessary optimality conditions of the robust weak efficient solution are given.Sufficient optimality conditions are obtained under pseudo-quasi-type-I generalized convexity assumption.Furthermore,we introduce the concept of robust weak saddle points to(NUMFP),and prove two theorems about robust weak saddle points.The main results in the present paper are verified by concrete examples.
基金supported by the National Natural Science Foundation of China(10871141)
文摘Let （E,ξ）=ind（En,ξn） be an inductive limit of a sequence （En,ξn）n∈N of locally convex spaces and let every step （En,ξn） be endowed with a partial order by a pointed convex （solid） cone Sn. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence （Sn）n∈N of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.
文摘In this paper,we study the connectedness of proper efficient solution sets of the vector optimization problem for a strict cone--quasiconvex mapping in a separated topological linear space.
文摘This paper studies the known density theorem of Arrow- Barankin-Blackwell. T he following main result is obtained: If X is a Hausdorff locally convex topological space and C X is a closed convex cone with bounded base, then for every nonempty weakly compact convex subset A, the set of positive proper efficient points of A is dense in the set of efficient points of A.
文摘There is a transition region between objects and background in any gray image. Many valuable applications of image segmentation and edge detection based on transition region determination have been developed in recent years. But, the complexity of calculation for determining transition region is too high. It results in the very limitation of applications based on transition region. A new novel fast method for transition region determination is presented in this paper, which will reduce the complexity of calculation dramatically. Many experiments have showed that this algorithm is effective and correct and will lay a good foundation for applications based on transition region. Key words image segmentation - transition region - maximum point - efficient average gradient (EAG) CLC number TP 391.4 Biography: Zhang Ai-hua (1965-), male, Ph. D candidate, research direction: image processing.
基金financially supported by the CSIR,New Delhi,India through Grant no.:25(0266)/17/EMR-II
文摘In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.
基金Supported by the National Natural Science Foundation of China(19871009)
文摘In this paper, optimality conditions for multiobjective programming problems having V-invex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function.Furthermore, a (α, η)-Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of saddle point are given.
