Abstract

For solving the canonical DC programming problem (i.e. a convex program with an additional reverse convex constraint) several cutting plane procedures have been developed in the past few years which suffer from serious defects regarding efficiency or convergence. We discuss a general conceptual framework of outer approximation unifying various conjunctive cutting plane approaches and on this basis propose modifications to overcome these defects.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.