摘要
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]).
This paper derives first order necessary and sufficient conditions for unconstrained cone d.c. programming problems where the underlined space is partially ordered with respect to a cone. These conditions are given in terms of directional derivatives and subdifferentials of the component functions. Moreover, conjugate duality for cone d.c. optimization is discussed and weak duality theorem is proved in a more general partially ordered linear topological vector space (generalizing the results in [11]).
