Abstract
<abstract><p>This paper deals with the robust strong duality for nonconvex optimization problem with the data uncertainty in constraint. A new weak conjugate function which is abstract convex, is introduced and three kinds of robust dual problems are constructed to the primal optimization problem by employing this weak conjugate function: the robust augmented Lagrange dual, the robust weak Fenchel dual and the robust weak Fenchel-Lagrange dual problem. Characterizations of inequality (1.1) according to robust abstract perturbation weak conjugate duality are established by using the abstract convexity. The results are used to obtain robust strong duality between noncovex uncertain optimization problem and its robust dual problems mentioned above, the optimality conditions for this noncovex uncertain optimization problem are also investigated.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference34 articles.
1. A. Y. Azimov, R. N. Gasimov, On weak conjugacy, weak subdifferentials and duality with zero gap in nonconvex optimization, Int. J. Appl. Math., 1 (1999), 171-192.
2. E. J. Balder, An extension of duality-stability relations to nonconvex optimization problems, SIAM J. Control Optim., 15 (2006), 329-343.
3. A. Beck, A. Ben-Tal, Duality in robust optimization: Primal worst equals dual best, Oper. Res. Lett., 37 (2009), 1-6.
4. A. Ben-Tal, S. Boyd, A. Nemirovski, Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems, Math. Program., 107 (2006), 63-89.
5. D. Bertsimas, D. Brown, Constructing uncertainty sets for robust linear optimization, Oper. Res., 57 (2009), 1483-1495.