Skip to main content
Log in

A dwindling filter line search algorithm for nonlinear equality constrained optimization

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper proposes a dwindling filter line search algorithm for nonlinear equality constrained optimization. A dwindling filter, which is a modification of the traditional filter, is employed in the algorithm. The envelope of the dwindling filter becomes thinner and thinner as the step size approaches zero. This new algorithm has more flexibility for the acceptance of the trial step and requires less computational costs compared with traditional filter algorithm. The global and local convergence of the proposed algorithm are given under some reasonable conditions. The numerical experiments are reported to show the effectiveness of the dwindling filter algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fletcher R and Leyffer S, Nonlinear programming without a penalty function, Math. Program, 2002, 91: 239–269.

    Article  MATH  MathSciNet  Google Scholar 

  2. Fletcher R, Leyffer S, and Toint P L, On the global convergence of a filter-SQP algorithm, SIAM J. Optim, 2002, 13: 44–59.

    Article  MATH  MathSciNet  Google Scholar 

  3. Fletcher R, Gould N I M, Leyffer S, Toint P L, and Wächter A, Global convergence of a trustregion SQP-filter algorithm for general nonlinear programming, SIAM J. Optim, 2002, 13: 635–659.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gonzaga C C, Karas E, and Vanti M, A globally convergent filter method for nonlinear programming, Technical Report, Department of Mathematics, Federal University of Santa Catarina, Brazil, 2001 (Revised 2002).

    Google Scholar 

  5. Wächter A and Biegler L T, Line search filter methods for nonlinear programming: Motivation and global convergence, SIAM J. Comput, 2005, 16: 1–31.

    MATH  Google Scholar 

  6. Wächter A and Biegler L T, Line search filter methods for nonlinear programming: Local convergence, SIAM J. Optim, 2005, 6: 32–48.

    Article  Google Scholar 

  7. Wang Z and Zhu D, A line search filter secant method for nonlinear equality constrained optimization, Journal of Systems Science and Complexity, 2010, 23(2): 343–361.

    Article  MathSciNet  Google Scholar 

  8. Nie P and Ma C, A trust region filter mehtod for general nonlinear programming, Appl. Math. Comput., 2006, 172: 1000–1017.

    Article  MATH  MathSciNet  Google Scholar 

  9. Shen C, Xue W, and Pu D, A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming, International Journal of Computer Mathematics, 2009, 86: 2201–2217.

    Article  MATH  MathSciNet  Google Scholar 

  10. Li C and Sun W, On filter-successive linearization methods for nonlinear semidefinite programming, Sci. China Ser. A, 2009, 52: 2341–2361.

    Article  MATH  MathSciNet  Google Scholar 

  11. Gu C and Zhu D, A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, Numer. Algor., 2011, 56: 537–559.

    Article  MATH  MathSciNet  Google Scholar 

  12. Long J and Zeng S Y, A projection filter method for solving nonlinear complementarity problems, Appl. Math. Comput., 2010, 216: 330–307.

    Google Scholar 

  13. Su K, A globally and superlinearly convergent modified SQP-filter method, Journal of Global Optimization, 2008, 41: 203–217.

    Article  MATH  Google Scholar 

  14. Chen Y and Sun W, A dwindling filter line search method for unconstrained optimization, Technical Report of Optimization No: 2010-09-01, School of Mathematical Science, Nanjing Normal University, Nanjing, China. Optimization Online: http://www.optimizationonline.org/DBHTML/2011/03/2960.html.

  15. Gould N I M, Sainvitu C, and Toint P L, A filter-trust-region method for unconstrained optimization, SIAM J. Optim., 2005, 16: 341–357.

    Article  MATH  MathSciNet  Google Scholar 

  16. Fontecilla R, Local convergence of secant methods for nonlinear constrained optimization, SIAM J. Numer. Anal, 1988, 25: 692–712.

    Article  MATH  MathSciNet  Google Scholar 

  17. Zhang J and Zhu D, A projective quasi-Newton method for nonlinear optimization, J. Comput. Appl. Math, 1994, 53: 291–307.

    Article  MATH  MathSciNet  Google Scholar 

  18. Nocedal J and Wright S, Numerical Optimization, Springer-Verlag, New York, 1999.

    Book  MATH  Google Scholar 

  19. Sun W and Yuan W, Optimization Theory and Methods: Nonlinear Programming, Springer Optimization and Its Applications (SOIA), Volume 1, Springer, New York, 2006.

    Google Scholar 

  20. Schittkowski K, More test examples for nonlinear mathematical programming codes, Lecture Notes in Economics and Mathematics System, vol. 282, Springer-Verlag, Berlin, Heidelberg, 1987.

    Google Scholar 

  21. Hock W and Schittkowski K, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematics System, vol. 187, Springer-Verlag, 1981.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Detong Zhu.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant Nos. 11201304, 11371253, the Innovation Program of Shanghai Municipal Education Commission under Grant No. 12YZ174, and Group of Accounting and Governance Disciplines (10kq03).

This paper was recommended for publication by Editor DAI Yuhong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gu, C., Zhu, D. A dwindling filter line search algorithm for nonlinear equality constrained optimization. J Syst Sci Complex 28, 623–637 (2015). https://doi.org/10.1007/s11424-014-2024-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-2024-1

Keywords

Navigation