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]).展开更多
文摘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]).