arXiv Analytics

Sign in

arXiv:1906.07758 [math.OC]AbstractReferencesReviewsResources

Duality suitable for a class of non-convex optimization problems

Fabio Botelho

Published 2019-06-18Version 1

In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the critical points of the primal and dual formulations and formally prove there is no duality gap between such formulations, in a local extremal context.

Related articles: Most relevant | Search more
arXiv:1903.06014 [math.OC] (Published 2019-03-14)
A duality principle for non-convex optimization in $\mathbb{R}^n$
arXiv:2402.10402 [math.OC] (Published 2024-02-16)
Non-convex optimization problems for maximum hands-off control
arXiv:1712.04809 [math.OC] (Published 2017-12-13)
A duality principle for a semi-linear model in micro-magnetism