Strong and total Fenchel dualities for robust convex optimization problems

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present some strong and total Fenchel dualities for convex programming problems with data uncertainty within the framework of robust optimization in locally convex Hausdorff vector spaces. By using the properties of the epigraph of the conjugate functions, we give some new constraint qualifications, which characterizes completely the strong duality and the stable strong duality. Moreover, some sufficient and/or necessary conditions for the total duality and converse duality are also obtained.

Cite

CITATION STYLE

APA

Wang, M., Fang, D., & Chen, Z. (2015). Strong and total Fenchel dualities for robust convex optimization problems. Journal of Inequalities and Applications, 2015(1). https://doi.org/10.1186/s13660-015-0592-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free