This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in t...This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in terms of directional derivatives and subdifferentials of thecomponent functions. Moreover, conjugate duality for cone d.c. Optimization is discussed andweak duality theorem is proved in a more general partially ordered linear topological vectorspace (generalizing the results in [11]).展开更多
In this paper, we consider a general composite convex optimization problem with a cone-convex system in locally convex Hausdorff topological vector spaces. Some Fenchel conjugate transforms for the composite convex fu...In this paper, we consider a general composite convex optimization problem with a cone-convex system in locally convex Hausdorff topological vector spaces. Some Fenchel conjugate transforms for the composite convex functions are derived to obtain the equivalent condition of the Stable Farkas Lemma, which is formulated by using the epigraph of the conjugates for the convex functions involved and turns out to be weaker than the classic Slater condition. Moreover, we get some necessary and sufficient conditions for stable duality results of the composite convex functions and present an example to illustrate that the monotonic increasing property of the outer convex function in the objective function is essential. Our main results in this paper develop some recently results.展开更多
文摘This paper derives first order necessary and sufficient conditions for unconstrained coned.c. Programming problems where the underlined space is partially ordered with respect to acone. These conditions are given in terms of directional derivatives and subdifferentials of thecomponent functions. Moreover, conjugate duality for cone d.c. Optimization is discussed andweak duality theorem is proved in a more general partially ordered linear topological vectorspace (generalizing the results in [11]).
基金Supported by the Natural Science Foundation of China(Nos.11401533,11301484,11071180,11371273,11171247)Hong Kong Polytechnic University(G-YX1Q)+1 种基金the Research Grants Council of Hong Kong(No.Poly U 5306/11E)Scientific Research Foundation of Zhejiang Agriculture and Forestry University(No.2013FR080)
文摘In this paper, we consider a general composite convex optimization problem with a cone-convex system in locally convex Hausdorff topological vector spaces. Some Fenchel conjugate transforms for the composite convex functions are derived to obtain the equivalent condition of the Stable Farkas Lemma, which is formulated by using the epigraph of the conjugates for the convex functions involved and turns out to be weaker than the classic Slater condition. Moreover, we get some necessary and sufficient conditions for stable duality results of the composite convex functions and present an example to illustrate that the monotonic increasing property of the outer convex function in the objective function is essential. Our main results in this paper develop some recently results.
