Duality suitable for a class of non-convex optimization problems
Optimization and Control
2019-06-26 v2
Abstract
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.
Cite
@article{arxiv.1906.07758,
title = {Duality suitable for a class of non-convex optimization problems},
author = {Fabio Botelho},
journal= {arXiv preprint arXiv:1906.07758},
year = {2019}
}
Comments
7 pages, a minor error and some typos corrected