Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 145083, 11 pages
http://dx.doi.org/10.1155/2012/145083
Research Article

An Augmented Lagrangian Algorithm for Solving Semiinfinite Programming

1Department of Mathematics, Shandong Normal University, Jinan, China
2Institute for Operations Research, Qufu Normal University, Qufu, China

Received 16 July 2012; Accepted 12 September 2012

Academic Editor: Jian-Wen Peng

Copyright © 2012 Qian Liu and Changyu Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. Bhattacharjee, P. Lemonidis, W. H. Green Jr., and P. I. Barton, “Global solution of semi-infinite programs,” Mathematical Programming, vol. 103, no. 2, pp. 283–307, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. R. Hettich and K. O. Kortanek, “Semi-infinite programming: theory, methods, and applications,” SIAM Review, vol. 35, no. 3, pp. 380–429, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. G. Still, “Discretization in semi-infinite programming: the rate of convergence,” Mathematical Programming, vol. 91, no. 1, pp. 53–69, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. Y. Tanaka, M. Fukushima, and T. Ibaraki, “A globally convergent SQP method for semi-infinite nonlinear optimization,” Journal of Computational and Applied Mathematics, vol. 23, no. 2, pp. 141–153, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. M. R. Hestenes, “Multiplier and gradient methods,” Journal of Optimization Theory and Applications, vol. 4, pp. 303–320, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. M. J. D. Powell, “A method for nonlinear constraints in minimization problems,” in Optimization, R. Fletcher, Ed., pp. 283–298, Academic Press, London, UK, 1969. View at Google Scholar · View at Zentralblatt MATH
  7. R. T. Rockafellar, “Augmented Lagrange multiplier functions and duality in nonconvex programming,” SIAM Journal on Control and Optimization, vol. 12, pp. 268–285, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. X. Q. Yang and K. L. Teo, “Nonlinear Lagrangian functions and applications to semi-infinite programs,” Annals of Operations Research, vol. 103, pp. 235–250, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. J.-J. Rückmann and A. Shapiro, “Augmented Lagrangians in semi-infinite programming,” Mathematical Programming, vol. 116, no. 1-2, pp. 499–512, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. D.-H. Li, L. Qi, J. Tam, and S.-Y. Wu, “A smoothing Newton method for semi-infinite programming,” Journal of Global Optimization, vol. 30, no. 2-3, pp. 169–194, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. L. Qi, C. Ling, X. Tong, and G. Zhou, “A smoothing projected Newton-type algorithm for semi-infinite programming,” Computational Optimization and Applications, vol. 42, no. 1, pp. 1–30, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. L. Qi, A. Shapiro, and C. Ling, “Differentiability and semismoothness properties of integral functions and their applications,” Mathematical Programming, vol. 102, no. 2, pp. 223–248, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. L. Qi, S.-Y. Wu, and G. Zhou, “Semismooth Newton methods for solving semi-infinite programming problems,” Journal of Global Optimization, vol. 27, no. 2-3, pp. 215–232, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. M. Gugat and M. Herty, “The smoothed-penalty algorithm for state constrained optimal control problems for partial differential equations,” Optimization Methods & Software, vol. 25, no. 4–6, pp. 573–599, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. E. G. Birgin, R. A. Castillo, and J. M. Martínez, “Numerical comparison of augmented Lagrangian algorithms for nonconvex problems,” Computational Optimization and Applications, vol. 31, no. 1, pp. 31–55, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. A. R. Conn, N. I. M. Gould, and P. L. Toint, “A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds,” SIAM Journal on Numerical Analysis, vol. 28, no. 2, pp. 545–572, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. P. Tseng and D. P. Bertsekas, “On the convergence of the exponential multiplier method for convex programming,” Mathematical Programming, vol. 60, no. 1, pp. 1–19, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. A. R. Conn and N. I. M. Gould, “An exact penalty function for semi-infinite programming,” Mathematical Programming, vol. 37, no. 1, pp. 19–40, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH