About this Journal Submit a Manuscript Table of Contents
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 976509, 9 pages
http://dx.doi.org/10.1155/2013/976509
Research Article

Global Convergence of a New Nonmonotone Filter Method for Equality Constrained Optimization

College of Mathematics and Computer Science, Hebei University, Baoding 071002, China

Received 6 December 2012; Accepted 5 March 2013

Academic Editor: Hadi Nasseri

Copyright © 2013 Ke Su 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. R. H. Byrd, R. B. Schnabel, and G. A. Shultz, “A trust region algorithm for nonlinearly constrained optimization,” SIAM Journal on Numerical Analysis, vol. 24, no. 5, pp. 1152–1170, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. J. E. Dennis Jr., M. El-Alem, and M. C. Maciel, “A global convergence theory for general trust-region-based algorithms for equality constrained optimization,” SIAM Journal on Optimization, vol. 7, no. 1, pp. 177–207, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. M. J. D. Powell and Y. Yuan, “A trust region algorithm for equality constrained optimization,” Mathematical Programming A, vol. 49, no. 2, pp. 189–211, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  4. R. Fletcher and S. Leyffer, “Nonlinear programming without a penalty function,” Mathematical Programming A, vol. 91, no. 2, pp. 239–269, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. C. M. Chin and R. Fletcher, “On the global convergence of an SLP-filter algorithm that takes EQP steps,” Mathematical Programming A, vol. 96, no. 1, pp. 161–177, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. 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–659, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. 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
  8. S. Ulbrich, “On the superlinear local convergence of a filter-SQP method,” Mathematical Programming B, vol. 100, no. 1, pp. 217–245, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. Ulbrich, S. Ulbrich, and L. N. Vicente, “A globally convergent primal-dual interior-point filter method for nonlinear programming,” Mathematical Programming A, vol. 100, no. 2, pp. 379–410, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. R. Fletcher and S. Leyffer, “A bundle filter method for nonsmooth nonlinear optimization,” Tech. Rep. NA/195, Department of Mathematics, University of Dundee, Dundee, Scotland, December 1999.
  11. 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 Zentralblatt MATH · View at MathSciNet
  12. M. Ulbrich and S. Ulbrich, “Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function,” Mathematical Programming B, vol. 95, no. 1, pp. 103–135, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. K. Su and D. Pu, “A nonmonotone filter trust region method for nonlinear constrained optimization,” Journal of Computational and Applied Mathematics, vol. 223, no. 1, pp. 230–239, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. K. Su and Z. Yu, “A modified SQP method with nonmonotone technique and its global convergence,” Computers & Mathematics with Applications, vol. 57, no. 2, pp. 240–247, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. N. I. M. Gould and P. L. Toint, “Global convergence of a non-monotone trust-region filter algorithm for nonlinear programming,” in Multiscale optimization methods and applications, vol. 82, pp. 125–150, Springer, New York, NY, USA, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. Z. Chen and X. Zhang, “A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization,” Journal of Computational and Applied Mathematics, vol. 172, no. 1, pp. 7–39, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. Z. W. Chen, “A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization,” Applied Mathematics and Computation, vol. 173, no. 2, pp. 1014–1046, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. F. A. M. Gomes, M. C. Maciel, and J. M. Martínez, “Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters,” Mathematical Programming A, vol. 84, no. 1, pp. 161–200, 1999. View at Zentralblatt MATH · View at MathSciNet
  19. M. J. D. Powell, “Convergence properties of a class of minimization algorithms,” in Nonlinear Programming, pp. 1–27, Academic Press, New York, NY, USA, 1974. View at MathSciNet
  20. K. Schittkowski, More Test Examples for Nonlinear Programming Codes, vol. 282, Springer, Berlin, Germany, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  21. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, vol. 187, Springer, Berlin, Germany, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  22. M. Lalee, J. Nocedal, and T. Plantenga, “On the implementation of an algorithm for large-scale equality constrained optimization,” SIAM Journal on Optimization, vol. 8, no. 3, pp. 682–706, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet