On Fenchel c-conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
Optimization and Control
2025-01-15 v1
Abstract
In this paper we present two Fenchel-type dual problems for a DC (difference of convex functions) optimization primal one. They have been built by means of the c-conjugation scheme, a pattern of conjugation which has been shown to be suitable for evenly convex functions. We study characterizations of weak, strong and stable strong duality for both pairs of primal-dual problems. We also give conditions which relate the existence of strong and stable strong duality for both pairs.
Keywords
Cite
@article{arxiv.2501.08061,
title = {On Fenchel c-conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality},
author = {M. D. Fajardo and J. Vidal-Nunez},
journal= {arXiv preprint arXiv:2501.08061},
year = {2025}
}