On Fenchel c-conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
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 o...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad de Alcalá (UAH) |
| Repositorio: | e_Buah Biblioteca Digital Universidad de Alcalá |
| Idioma: | inglés |
| OAI Identifier: | oai:ebuah.uah.es:10017/68235 |
| Acceso en línea: | http://hdl.handle.net/10017/68235 https://dx.doi.org/10.1080/02331934.2023.2230988 |
| Access Level: | acceso abierto |
| Palabra clave: | Generalized convex conjugation Evenly convex function DC problem Fenchel duality Matemáticas Mathematics |
| Sumario: | 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. |
|---|