On surrogate duality for robust semi-infinite optimization problem

다국어 초록 (Multilingual Abstract)

A semi-infinite optimization problem involving a quasi-convex objective function and infinitely many convex constraintfunctions with data uncertainty is considered. A surrogate dualitytheorem for the semi-infinite optimization problem is given undera closed and convex cone constraint qualification.

참고문헌 (Reference)

1 J. P. Penot, "Surrogate programming and multipliers in quasi-convex programming" 42 : 1994-2003, 2004

2 H. J. Greenberg, "Surrogate mathematical programming" 18 : 924-939, 1970

3 S. Suzuki, "Surrogate duality for robust optimization" 231 : 257-262, 2013

4 V. Jeyakumar, "Strong duality in robust convex programming:complete characterizations" 20 : 3384-3407, 2010

5 G. Y. Li, "Robust conjugate duality for convex op-timization under uncertainty with application to data classification" 74 : 2327-2341, 2011

6 D. G. Luenberger, "Quasi-convex programming" 16 : 1090-1095, 1968

7 H. J. Greenberg, "Quasi-conjugate functions and surrogate duality" 21 : 162-178, 1973

8 J. P. Penot, "On quasi-convex duality" 15 : 597-625, 1990

9 V. Jeyakumar, "New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs" 20 : 534-547, 2003

10 S. Suzuki, "Necessary and sufficient constraint qualification for surrogate duality" 152 : 366-377, 2012

11 A. Beck, "Duality in robust optimization: primal worst equals dual best" 37 : 1-6, 2009

12 F. Glover, "A Multiphase-dual algorithm for the zero-one integer programming problem" 13 : 879-919, 1965