Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914079091720192 |
|---|---|
| author | Latorre, Vittorio |
| author_facet | Latorre, Vittorio |
| contents | We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To better understand this duality, we compare it with classical Lagrange duality by analyzing a related, yet more complex, constrained problem. We demonstrate that the newly derived stationarity conditions are equivalent to the classical Lagrange stationarity conditions for the constrained problem, as expected by the close relationship between Fenchel and Lagrange dualities. We introduce two non-convex optimization problems and prove strong duality results with their respective duals. The second problem is a constrained optimization problem whose dual is obtained through the concurrent use of the duality theory introduced in this paper and classical Lagrange duality for constrained optimization. We also report numerical tests where we solve randomly generated instances of the presented problems using an ad-hoc primal-dual potential reduction interior point method that directly exploits the global optimality conditions established in this paper. The results include a comparison with a well-known conic programming solver applied to the convex duals of the analyzed problems. The interior point method successfully reduces the duality gap close to zero, validating the proposed duality framework. The theory presented in this paper can be applied to various non-convex problems and serves as a valuable tool in the field of hidden convex optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05741 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework Latorre, Vittorio Optimization and Control We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To better understand this duality, we compare it with classical Lagrange duality by analyzing a related, yet more complex, constrained problem. We demonstrate that the newly derived stationarity conditions are equivalent to the classical Lagrange stationarity conditions for the constrained problem, as expected by the close relationship between Fenchel and Lagrange dualities. We introduce two non-convex optimization problems and prove strong duality results with their respective duals. The second problem is a constrained optimization problem whose dual is obtained through the concurrent use of the duality theory introduced in this paper and classical Lagrange duality for constrained optimization. We also report numerical tests where we solve randomly generated instances of the presented problems using an ad-hoc primal-dual potential reduction interior point method that directly exploits the global optimality conditions established in this paper. The results include a comparison with a well-known conic programming solver applied to the convex duals of the analyzed problems. The interior point method successfully reduces the duality gap close to zero, validating the proposed duality framework. The theory presented in this paper can be applied to various non-convex problems and serves as a valuable tool in the field of hidden convex optimization. |
| title | Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.05741 |