2011): Robust conjugate duality for convex optimization under uncertainty with application to data classification, Nonlinear Analysis: Theory

In this paper we present a robust conjugate duality theory for convex programming problems in the face of data uncertainty within the framework of robust optimiza-tion, extending the powerful conjugate duality technique. We first establish robust strong duality between an uncertain primal parameterized convex programming model problem and its uncertain conjugate dual by proving strong duality between the deterministic robust counterpart of the primal model and the optimistic coun-terpart of its dual problem under a regularity condition. This regularity condition is not only sufficient for robust duality but also is necessary for it whenever robust duality holds for every linear perturbation of the objective function of the primal model problem. More importantly, we show that robust strong duality always holds for partially finite convex programming problems under scenario data uncertainty and that the optimistic counterpart of the dual is a tractable finite dimensional problem. As an application, we also derive a robust conjugate duality theorem for support vector machines which are a class of important convex optimization models for classifying two labelled data sets. The support vector machine has emerged as a powerful modelling tool for machine learning problems of data classification that arise in many areas of application in information and computer sciences. ∗The authors are grateful to the referee and the Editor for their helpful comments and valuabl