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

Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems

1The Department of Mathematics and Econometrics, Hunan University of Humanities, Science and Technology, Loudi 417000, China
2The Department of Information Science and Engineering, Hunan University of Humanities, Science and Technology, Loudi 417000, China

Received 15 March 2014; Revised 19 July 2014; Accepted 25 August 2014; Published 2 September 2014

Academic Editor: Kazutake Komori

Copyright © 2014 Zhijun Luo and Lirong 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. A. Baums, “Minimax method in optimizing energy consumption in real-time embedded systems,” Automatic Control and Computer Sciences, vol. 43, no. 2, pp. 57–62, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. E. Y. Rapoport, “Minimax optimization of stationary states in systems with distributed parameters,” Journal of Computer and Systems Sciences International, vol. 52, no. 2, pp. 165–179, 2013. View at Google Scholar
  3. E. Polak, D. Q. Mayne, and J. E. Higgins, “Superlinearly convergent algorithm for min-max problems,” Journal of Optimization Theory and Applications, vol. 69, no. 3, pp. 407–439, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. R. Reemtsen, “A cutting plane method for solving minimax problems in the complex plane,” Numerical Algorithms, vol. 2, no. 3-4, pp. 409–436, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. J. L. Zhou and A. L. Tits, “Nonmonotone line search for minimax problems,” Journal of Optimization Theory and Applications, vol. 76, no. 3, pp. 455–476, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. L. Grippo, F. Lampariello, and S. Lucidi, “A nonmonotone line search technique for Newton's method,” SIAM Journal on Numerical Analysis, vol. 23, no. 4, pp. 707–716, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. Y. H. Yu and L. Gao, “Nonmonotone line search algorithm for constrained minimax problems,” Journal of Optimization Theory and Applications, vol. 115, no. 2, pp. 419–446, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. F. Wang and Y. Wang, “Nonmonotone algorithm for minimax optimization problems,” Applied Mathematics and Computation, vol. 217, no. 13, pp. 6296–6308, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. Y. Xue, “A SQP Method for Minimax Problems,” Journal of System Science and Math Science, vol. 22, no. 3, pp. 355–364, 2002 (Chinese). View at Google Scholar · View at MathSciNet
  10. B. Rustem and Q. Nguyen, “An algorithm for the inequality-constrained discrete min-max problem,” SIAM Journal on Optimization, vol. 8, no. 1, pp. 265–283, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. E. Obasanjo, G. Tzallas-Regas, and B. Rustem, “An interior-point algorithm for nonlinear minimax problems,” Journal of Optimization Theory and Applications, vol. 144, no. 2, pp. 291–318, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. B. Rustem, S. Žakovic, and P. Parpas, “An interior point algorithm for continuous minimax: implementation and computation,” Optimization Methods and Software, vol. 23, no. 6, pp. 911–928, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Feng, L. Hongwei, Z. Shuisheng, and L. Sanyang, “A smoothing trust-region Newton-CG method for minimax problem,” Applied Mathematics and Computation, vol. 199, no. 2, pp. 581–589, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. S. P. Han, “A globally convergent method for nonlinear programming,” Journal of Optimization Theory and Applications, vol. 22, no. 3, pp. 297–309, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. M. J. D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations,” in Numerical Analysis, pp. 144–157, Springer, Berlin, Germany, 1978. View at Google Scholar
  16. G. He, Z. Gao, and Y. Lai, “New sequential quadratic programming algorithm with consistent subproblems,” Science in China A: Mathematics, vol. 40, no. 2, pp. 137–150, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  17. E. R. Panier and A. L. Tits, “A superlinearly convergent feasible method for the solution of inequality constrained optimization problems,” SIAM Journal on Control and Optimization, vol. 25, no. 4, pp. 934–950, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. Z. Wan, “A modified SQP algorithm for mathematical programs with linear complementarity constraints,” ACTA Scientiarum Naturalium Universitatis Normalis Hunanensis, vol. 26, pp. 9–12, 2001. View at Google Scholar
  19. Z. Zhu, K. Zhang, and J. Jian, “An improved SQP algorithm for inequality constrained optimization,” Mathematical Methods of Operations Research, vol. 58, no. 2, pp. 271–282, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. Z. Luo, G. Chen, S. Luo, and Z. Zhu, “Improved feasible SQP algorithm for nonlinear programs with equality constrained sub-problems,” Journal of Computers, vol. 8, no. 6, pp. 1496–1503, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. Z. Zhu and C. Zhang, “A superlinearly convergent sequential quadratic programming algorithm for minimax problems,” Journal of Numerical Methods and Applications, vol. 27, no. 4, pp. 15–32, 2005. View at Google Scholar
  22. J. Jian, R. Quan, and Q. Hu, “A new superlinearly convergent SQP algorithm for nonlinear minimax problems,” Acta Mathematicae Applicatae Sinica, vol. 23, no. 3, pp. 395–410, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. Q. Hu, Y. Chen, N. Chen, and X. Li, “A modified SQP algorithm for minimax problems,” Journal of Mathematical Analysis and Applications, vol. 360, no. 1, pp. 211–222, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. W. Xue, C. Shen, and D. Pu, “A new non-monotone SQP algorithm for the minimax problem,” International Journal of Computer Mathematics, vol. 86, no. 7, pp. 1149–1159, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. J. Jian, X. Zhang, R. Quan, and Q. Ma, “Generalized monotone line search SQP algorithm for constrained minimax problems,” Optimization, vol. 58, no. 1, pp. 101–131, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. R. Fletcher, S. Leyffer, and P. L. Toint, “On the global convergence of a filter—SQP algorithm,” SIAM Journal on Optimization, vol. 13, no. 1, pp. 44–59, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. S. Ulbrich, “On the superlinear local convergence of a filter-SQP method,” Mathematical Programming, vol. 100, no. 1, Ser. B, pp. 217–245, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. K. Su and J. Che, “A modified SQP-filter method and its global convergence,” Applied Mathematics and Computation, vol. 194, no. 1, pp. 92–101, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. C. Shen, W. Xue, and X. Chen, “Global convergence of a robust filter SQP algorithm,” European Journal of Operational Research, vol. 206, no. 1, pp. 34–45, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. C. Gu and D. Zhu, “A non-monotone line search multidimensional filter-SQP method for general nonlinear programming,” Numerical Algorithms, vol. 56, no. 4, pp. 537–559, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus