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

A Globally Convergent Line Search Filter SQP Method for Inequality Constrained Optimization

Department of Mathematics, Shanghai Maritime University, Shanghai 201306, China

Received 17 February 2013; Revised 3 August 2013; Accepted 9 August 2013

Academic Editor: Jung-Fa Tsai

Copyright © 2013 Zhong Jin. 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. P. T. Boggs and J. W. Tolle, “Sequential quadratic programming,” in Acta Numerica, pp. 1–51, Cambridge University Press, Cambridge, UK, 1995. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. J. V. Burke and S.-P. Han, “A robust sequential quadratic programming method,” Mathematical Programming, vol. 43, no. 3, pp. 277–303, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. G. Zhou, “A modified SQP method and its global convergence,” Journal of Global Optimization, vol. 11, no. 2, pp. 193–205, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J.-L. Zhang and X.-S. Zhang, “A modified SQP method with nonmonotone linesearch technique,” Journal of Global Optimization, vol. 21, no. 2, pp. 201–218, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. J. F. A. D. O. Pantoja and D. Q. Mayne, “Exact penalty function algorithm with simple updating of the penalty parameter,” Journal of Optimization Theory and Applications, vol. 69, no. 3, pp. 441–467, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. T. Liu and D. Li, “Convergence of the BFGS-SQP method for degenerate problems,” Numerical Functional Analysis and Optimization, vol. 28, no. 7-8, pp. 927–944, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. T.-w. Liu and J.-p. Zeng, “An SQP algorithm with cautious updating criteria for nonlinear degenerate problems,” Acta Mathematicae Applicatae Sinica, vol. 25, no. 1, pp. 33–42, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function,” Mathematical Programming, vol. 91, no. 2, pp. 239–269, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. 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 Zentralblatt MATH · View at MathSciNet
  10. R. Fletcher, N. I. M. Gould, S. Leyffer, P. L. Toint, and A. Wächter, “Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming,” SIAM Journal on Optimization, vol. 13, no. 3, pp. 635–660, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. A. Wächter and L. T. Biegler, “Line search filter methods for nonlinear programming: motivation and global convergence,” SIAM Journal on Optimization, vol. 16, no. 1, pp. 1–31, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  12. A. Wächter and L. T. Biegler, “Line search filter methods for nonlinear programming: local convergence,” SIAM Journal on Optimization, vol. 16, no. 1, pp. 32–48, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  13. 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 Zentralblatt MATH · View at MathSciNet
  14. K. Su, “A globally and superlinearly convergent modified SQP-filter method,” Journal of Global Optimization, vol. 41, no. 2, pp. 203–217, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. 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 Zentralblatt MATH · View at MathSciNet
  16. C. Shen, W. Xue, and D. Pu, “Global convergence of a tri-dimensional filter SQP algorithm based on the line search method,” Applied Numerical Mathematics, vol. 59, no. 2, pp. 235–250, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. W. Xue, C. Shen, and D. Pu, “A penalty-function-free line search SQP method for nonlinear programming,” Journal of Computational and Applied Mathematics, vol. 228, no. 1, pp. 313–325, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. X. Wang, Z. Zhu, S. Zuo, and Q. Huang, “An SQP-filter method for inequality constrained optimization and its global convergence,” Applied Mathematics and Computation, vol. 217, no. 24, pp. 10224–10230, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. C. Gu, “Nonmonotone filter DQMM method for the system of nonlinear equations,” Applied Mathematics and Computation, vol. 217, no. 22, pp. 9351–9357, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. C. Gu and D. Zhu, “A secant algorithm with line search filter method for nonlinear optimization,” Applied Mathematical Modelling, vol. 35, no. 2, pp. 879–894, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. C. Gu and D. Zhu, “A filter algorithm for nonlinear systems of equalities and inequalities,” Applied Mathematics and Computation, vol. 218, no. 20, pp. 10289–10298, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. Z. Wang and D. Zhu, “A reduced Hessian algorithm with line search filter method for nonlinear programming,” Applied Mathematics and Computation, vol. 217, no. 19, pp. 7679–7691, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. X. Zhu and D. Pu, “Sequential quadratic programming with a flexible step acceptance strategy,” Applied Mathematical Modelling, vol. 36, no. 9, pp. 3992–4002, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. X. Zhu and D. Pu, “A line search filter algorithm with inexact step computations for equality constrained optimization,” Applied Numerical Mathematics, vol. 62, no. 3, pp. 212–223, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. X. Zhu and D. Pu, “A restoration-free filter SQP algorithm for equality constrained optimization,” Applied Mathematics and Computation, vol. 219, no. 11, pp. 6016–6029, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  26. X. Zhang, Z. Liu, and S. Liu, “A trust region SQP-filter method for nonlinear second-order cone programming,” Computers & Mathematics with Applications, vol. 63, no. 12, pp. 1569–1576, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. J. Nocedal and S. J. Wright, Numerical Optimization, Springer Series in Operations Research, Springer, New York, NY, USA, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  28. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, vol. 187 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Germany, 1981. View at Publisher · View at Google Scholar · View at MathSciNet