Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 159754, 9 pages
http://dx.doi.org/10.1155/2014/159754
Research Article

A Simple SQP Algorithm for Constrained Finite Minimax Problems

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

Received 30 August 2013; Accepted 7 November 2013; Published 10 February 2014

Academic Editors: Z.-C. Deng, K. Skouri, and K.-C. Ying

Copyright © 2014 Lirong Wang and Zhijun Luo. 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. X. Cai, K. L. Teo, X. Yang, and X. Y. Zhou, “Portfolio optimization under a minimax rule,” Management Science, vol. 46, no. 7, pp. 957–972, 2000. View at Google Scholar · View at Scopus
  2. A. R. Pankov, E. N. Platonov, and K. V. Semenikhin, “Minimax quadratic optimization and its application to investment planning,” Automation and Remote Control, vol. 62, no. 12, pp. 1978–1995, 2001. View at Google Scholar · View at Scopus
  3. 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
  4. 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
  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 Scopus
  6. L. Grippo, F. Lampariello, and S. Lucidi, “Nonmonotone line search technique for newton's method,” SIAM Journal on Numerical Analysis, vol. 23, no. 4, pp. 707–716, 1986. View at Google Scholar · 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 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 Scopus
  9. F. Wang and K. Zhang, “A hybrid algorithm for nonlinear minimax problems,” Annals of Operations Research, vol. 164, no. 1, pp. 167–191, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. Y. Xue, “A SQP method for minimax problems,” Journal of System Science and Math Science, vol. 22, pp. 355–364, 2002 (Chinese). View at Google Scholar
  11. 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 Google Scholar · View at Scopus
  12. 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 Scopus
  13. 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
  14. 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 Scopus
  15. L. H. Ma, Y. Zhang, C. N. Yang et al., “A neural network model for equality and inequality constrained minimax problems,” Information Technology Journal, vol. 11, no. 11, pp. 1655–1659, 2012. View at Google Scholar
  16. 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
  17. E. R. Panier and A. L. Tits, “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 Google Scholar · 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 and S. Wang, “A superlinearly convergent numerical algorithm for nonlinear programming,” Nonlinear Analysis, vol. 13, no. 5, pp. 2391–2402, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. Z. Luo, Z. Zhu, G. Chen et al., “A superlinearly convergent SQP algorithm for constrained optimization problems,” Journal of Computational Information Systems, vol. 9, no. 11, pp. 4443–4450, 2013. View at Google Scholar
  21. Z. Zhu and C. Zhang, “A superlinearly convergent sequential quadratic programming algorithm for minimax problems,” Chinese Journal of Numerical Mathematics and Applications, vol. 27, no. 4, pp. 15–32, 2005. View at Google Scholar
  22. J.-B. Jian, R. Quan, and Q.-J. 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 Scopus
  23. Q.-J. Hu and J.-Z. Hu, “A sequential quadratic programming algorithm for nonlinear minimax problems,” Bulletin of the Australian Mathematical Society, vol. 76, no. 3, pp. 353–368, 2007. View at Google Scholar · View at Scopus
  24. Q.-J. Hu, Y. Chen, N.-P. Chen, and X.-Q. 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 Scopus
  25. 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 Scopus
  26. J. B. Jian, X. L. Zhang, R. Quan, and Q. Ma, “Generalized monotone line search SQP algorithm for constrained minimax problems,” International Journal of Control, vol. 58, no. 1, pp. 101–131, 2009. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam, The Netherlands, 1960.
  28. M. M. Kostreva and X. Chen, “A superlinearly convergent method of feasible directions,” Applied Mathematics and Computation, vol. 116, no. 3, pp. 231–244, 2000. View at Google Scholar · View at Scopus
  29. F. Facchinei and S. Lucidi, “Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems,” Journal of Optimization Theory and Applications, vol. 85, no. 2, pp. 265–289, 1995. View at Publisher · View at Google Scholar · View at Scopus