Abstract
ABSTRACTThe paper concerns the study of a new class of conic programming with objectives given as the difference of a composite function and a convex function. We first introduce two new notions of regularity conditions in terms of the subdifferential of the involving functions. Under the new regularity conditions, we provide some necessary and/or sufficient conditions for KKT type optimality conditions to hold. Similarly, saddle point theorems and total Lagrange dualities for conic programming are also given.
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.