Abstract
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]).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.