Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

SOLVING A CLASS OF GENERALIZED SEMI-INFINITE PROGRAMMING VIA AUGMENTED LAGRANGIANS

  • Zhang, Haiyan (Department of Basic Sciences, Yantai Nanshan University) ;
  • Liu, Fang (Department of Basic Sciences, Yantai Nanshan University) ;
  • Wang, Changyu (College of Operations and Management, Qufu Normal University)
  • Published : 2009.01.31
Download PDF
⟨ Previous Next ⟩

Abstract

Under certain conditions, we use augmented Lagrangians to transform a class of generalized semi-infinite min-max problems into common semi-infinite min-max problems, with the same set of local and global solutions. We give two conditions for the transformation. One is a necessary and sufficient condition, the other is a sufficient condition which can be verified easily in practice. From the transformation, we obtain a new first-order optimality condition for this class of generalized semi-infinite min-max problems.

Keywords

References

  1. I.D.Coope and G.A.Watson,A projected Lagrangian algorithm for semi-infinite programming, Math. Program. 32(1985), 337-356. https://doi.org/10.1007/BF01582053
  2. E.Polak,Optimization: Algorithms and Consistent Approximations, Springer-Verlag, New York, 1997.
  3. E.Polak and J.O.Royset,On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems, Computational Optimization and Applications 31(2005), 173-192. https://doi.org/10.1007/s10589-005-2179-8
  4. E.Polak and A.L.Tits,A recursive quadratic programming algorithm for semi-infinite opti- mization problems, Appl. Math. Opt. 8(1982), 325-349. https://doi.org/10.1007/BF01447767
  5. R.T.Rockafellar,Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM J. Control 12(1974),268-285. https://doi.org/10.1137/0312021
  6. J.O.Royset, E.Polak and A.Der Kiureghian,Adaptive approximations and exeact penalization for the solution of generalized semi-infinite min-max problems, SIAM J. Optimization 14(2003),1-34. https://doi.org/10.1137/S1052623402406777
  7. O.Stein,First order optimality conditions for degenerate index sets in generated semi-infinite programming, Mathematics of Operations Research 26(2001), 565-582. https://doi.org/10.1287/moor.26.3.565.10583
  8. G.Still,Generalized semi-infinite programming: Theorey and methods, European J. of Operations Research 119(1999), 301-313. https://doi.org/10.1016/S0377-2217(99)00132-0
  9. X.L.Sun, D.Li and K.Mckinnon,On saddle points of augmented Lagrangians for constrained nonconvex optimization, SIAM Journal on Optimization 15(2005), 1128-1146. https://doi.org/10.1137/030602770
  10. Y.Tanaka, M.Fukushima and T.Ibaraki, A globally convergent SQP method for semi-infinite nonlinear optimization, Joural of Computational and Applied Mathematics 23(1988), 141-153. https://doi.org/10.1016/0377-0427(88)90276-2
  11. C.Y.Wang and D.Li, Unified theory of augmented lagrangian methods for constrained global optimization, Journal of Global Optimization to appear. https://doi.org/10.1007/s10898-008-9347-1
  12. G.A.Watson, Globally convergent methods for semi-infinite programming, BIT 21(1981), 362-373. https://doi.org/10.1007/BF01941472