Skip to main content

Advertisement

Log in

A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization

  • Published:
Chinese Annals of Mathematics, Series B Aims and scope Submit manuscript

Abstract

The authors propose a dwindling filter algorithm with Zhou’s modified subproblem for nonlinear inequality constrained optimization. The feasibility restoration phase, which is always used in the traditional filter method, is not needed. Under mild conditions, global convergence and local superlinear convergence rates are obtained. Numerical results demonstrate that the new algorithm is effective.

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. 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.

  2. Dolan, E. D. and Moré, J. J., Benchmarking optimization software with performance profiles, Math. Program., 91, 2002, 201–213.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Gu, C. and Zhu, D., A secant algorithm with line search filter method for nonlinear optimization, Appl. Math. Modell., 35, 2011, 879–894.

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  6. Jian, J. B. and Liu, Y., A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization, Nonlinear Anal. Real World Appl., 12, 2011, 2717–2729.

    Article  MATH  MathSciNet  Google Scholar 

  7. Long, J., Ma, C. F. and Nie, P. Y., A new filter method for solving nonlinear complementarity problems, Appl. Math. Comput., 185, 2007, 705–718.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Nie, P. Y., Sequential penalty quadratic programming filter methods for nonlinear programming, Nonlinear Anal. Real World Appl. 8, 2007, 118–129.

    Article  MATH  MathSciNet  Google Scholar 

  10. Nie, P. Y., A derivative-free method for the system of nonlinear equations, Nonlinear Anal. Real World Appl., 7, 2006, 378–384.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  13. Shen, C. G., Xue, W. J. and Pu, D. G., A filter SQP algorithm without a feasibility restoration phase, Comp. Appl. Math., 28, 2009, 167–194.

    Article  MATH  MathSciNet  Google Scholar 

  14. Su, K. and Yu, Z., A modified SQP method with nonmonotone technique and its global convergence, Comput. Math. Appl., 57, 2009, 240–247.

    Article  MATH  MathSciNet  Google Scholar 

  15. Su, K., A globally and superlinearly convergent modified SQP-filter method, J. Global Optim., 41, 2008, 203–217.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Wächter, A. and Biegler, L. T., On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. Program., 106, 2006, 225–57.

    Article  MathSciNet  Google Scholar 

  19. Zhou, G. L., A modified SQP method and its global convergence, J. Global Optim., 11, 1997, 193–205.

    Article  MATH  MathSciNet  Google Scholar 

  20. Zhu, Z. B. and Wang, S., A superlinearly convergent numerical algorithm for nonlinear programming, Nonlinear Anal. Real World Appl., 13, 2012, 2391–2402.

    Article  MATH  MathSciNet  Google Scholar 

  21. Zhu, Z. B. and Jian, J. B., An efficient feasible SQP algorithm for inequality constrained optimization, Nonlinear Anal. Real World Appl., 10, 2009, 1220–1228.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao Gu.

Additional information

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gu, C., Zhu, D. A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization. Chin. Ann. Math. Ser. B 35, 209–224 (2014). https://doi.org/10.1007/s11401-014-0826-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11401-014-0826-z

Keywords

2000 MR Subject Classification

Navigation