Beyond Canonical DC-Optimization: The Single Reverse Polar Problem

Abstract

We propose a novel generalization of the Canonical DC problem (CDC), and we study the convergence of outer approximation algorithms for its solution, which use an approximated oracle for checking the global optimality conditions. Although the approximated optimality conditions are similar to those of CDC, this new class of problems is shown to significantly differ from its special case. Indeed, outer approximation approaches for CDC need be substantially modified in order to cope with the more general problem, bringing to new algorithms.We develop a hierarchy of conditions that guarantee global convergence, and we build three different cutting plane algorithms relying on them.