Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 852074, 7 pages
http://dx.doi.org/10.1155/2014/852074
Research Article

A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems

Li Dong,1 Bo Yu,2,3 and Yu Xiao4

1College of Science, Dalian Nationalities University, Dalian 116600, China
2School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China
3School of Sciences, Dalian University of Technology, Dalian at Panjin 124221, China
4School of Basic Science, East China Jiaotong University, Nanchang 330013, China

Received 20 May 2014; Accepted 30 June 2014; Published 17 July 2014

Academic Editor: Mariano Torrisi

Copyright © 2014 Li Dong et al. 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. E. Polak, Optimization: Algorithms and Consistent Approximations, Springer, New York, NY, USA, 1997. View at MathSciNet
  2. J. W. Bandler, P. C. Liu, and H. Tromp, “A nonlinear programming approach to optimal design centering, tolerancing, and tuning,” IEEE Transactions on Circuits and Systems, vol. 23, no. 3, pp. 155–165, 1976. View at Google Scholar · View at MathSciNet · View at Scopus
  3. T. Chen and M. K. H. Fan, “On convex formulation of the floorplan area minimization problem,” in Proceedings of the International Symposium on Physical Design (ISPD '98), pp. 124–128, Academic Press, Monterey, Calif, USA, April 1998. View at Scopus
  4. A. V. Fiacco and K. O. Kortanek, Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 1983. View at MathSciNet
  5. 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 MathSciNet · View at Scopus
  6. A. A. Kassim and B. V. K. Vijaya Kumar, “Path planning for autonomous robots using neural networks,” Journal of Intelligent Systems, vol. 7, no. 1-2, pp. 33–55, 1997. View at Google Scholar · View at Scopus
  7. E. Polak, “On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems,” Mathematical Programming, vol. 62, no. 2, pp. 385–414, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. E. Polak and J. O. Royset, “Algorithms for finite and semi-infinite min-max-min problems using adaptive smoothing techniques,” Journal of Optimization Theory and Applications, vol. 119, no. 3, pp. 421–457, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. Z. Guanglu, C. Wang, and Q. Sun, “A globally convergent method for semi-infinite minimax problems,” Organ Transplantation, vol. 2, no. 2, p. 42, 1998. View at Google Scholar
  10. G. Zhou, C. Wang, and Y. Zhang, “An efficient method for semi-infinite programming,” Mathematics Numerical Sinica, vol. 21, no. 1, pp. 1–8, 1999. View at Google Scholar
  11. E. Polak, D. Q. Mayne, and J. E. Higgins, “On the extension of Newton's method to semi-infinite minimax problems,” SIAM Journal on Control and Optimization, vol. 30, no. 2, pp. 367–389, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. O. Yigui and Z. Qian, “A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming,” Applied Mathematics and Computation, vol. 215, no. 2, pp. 474–480, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. A. Auslender, M. A. Goberna, and M. A. López, “Penalty and smoothing methods for convex semi-infinite programming,” Mathematics of Operations Research, vol. 34, no. 2, pp. 303–319, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. L. Zhang, S. Fang, and S. Wu, “An entropy based central cutting plane algorithm for convex min-max semi-infinite programming problems,” Science China Mathematics, vol. 56, no. 1, pp. 201–211, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. E. Polak, J. O. Royset, and R. S. Womersley, “Algorithms with adaptive smoothing for finite minimax problems,” Journal of Optimization Theory and Applications, vol. 119, no. 3, pp. 459–484, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. E. Polak, R. S. Womersley, and H. X. Yin, “An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems,” Journal of Optimization Theory and Applications, vol. 138, no. 2, pp. 311–328, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. G. Zhao, Z. Wang, and H. Mou, “Uniform approximation of min/max functions by smooth splines,” Journal of Computational and Applied Mathematics, vol. 236, no. 5, pp. 699–703, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. L. Dong and B. Yu, “A spline smoothing Newton method for finite minimax problems,” Journal of Engineering Mathematics. In press.
  19. L. Dong, B. Yu, and G. H. Zhao, “A smoothing spline homotopy method for nonconvex nonlinear programming,” submitted.
  20. J. Nocedal, S. J. Wright, P. Glynn, and S. M. Robinson, Numerical Optimization, Springer Series in Operations Research, Springer, New York, NY, USA, 1999.
  21. X. Yu, Truncated Aggregate Smoothing Algorithms, School of Mathematical Sciences, Dalian University of Technology, Dalian, China, 2010.