Skip to main content
Log in

A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

An inexact two-piece update of projected Hessian method is proposed for nonlinear equality constrained optimization using line search filter technique. Unlike most existing filter methods, our proposed method does not require that a second order correction to improve the search direction and present the Maratos effect. Global convergence properties of the proposed algorithm are analyzed, while the line search filter inexact reduced Hessian method has q-superlinear local convergence rate if at least one of the update formulae is updated at each iteration. Numerical results on a collection of test problems illustrate the practical behavior of the method.

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. Byrd, R.H., Curtis, F.E., Nocedal, J.: An inexact SQP method for equality constrained optimization. SIAM J. Optim. 19, 351–369 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Byrd, R.H., Curtis, F.E., Nocedal, J.: An inexact Newton method for nonconvex equality constrained optimization. Math. Program. 122, 273–299 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chin, C.M., Fletcher, R.: On the global convergence of an SLP-filter algorithm takes EQP steps. Math. Program. 96, 161–177 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Coleman, T.F., Conn, A.R.: On the local convergence of a quasi-Newton method for the nonlinear programming problem. SIAM J. Numer. Anal. 21, 755–769 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Numer. Anal. 19, 400–408 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fletcher, R., Leyffer, S.: A bundle filter method for nonsmooth nonlinear optimization. Technical Report NA/195. Department of Mathematics, University of Dundee, Scotland (1999)

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Gurwitz, C.B.: Local convergence of two-piece update of a projected Hessian matrix. SIAM J. Optim. 4, 461–485 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  10. Jäger, H., Sachs, E.W.: Global convergence of inexact reduced SQP methods. Optim. Methods Softw. 7, 83–110 (1996)

    Article  Google Scholar 

  11. Karas, E., Ribeiro, A., Sagastizbal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. 116, 297–320 (2008)

    Article  Google Scholar 

  12. Leibfritz, F., Sachs, E.W.: Inexact SQP interior point methods and large scale optimal control problems. SIAM J. Control Optim. 38, 272–293 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Liu, M., Li, X., Pu, D.: A feasible filter SQP algorithm with global and local convergence. J. Appl. Math. Comput. 40, 261–275 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  14. Nocedal, J., Overton, M.L.: Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM J. Numer. Anal. 22, 821–850 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pereiraa, A.I., Costab, M.F.P., Fernandes, E.M.: Interior point filter method for semi-infinite programming problems. Optimization 60, 1309–1338 (2011)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Zhu, X., Pu, D.: A restoration-free filter SQP algorithm for equality constrained optimization. Appl. Math. Comput. 219, 6016–6029 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge the partial supports of the National Science Foundation Grant (11371253) of China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhujun Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cai, L., Wang, Z. & Zhu, D. A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization. J. Appl. Math. Comput. 48, 365–380 (2015). https://doi.org/10.1007/s12190-014-0807-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-014-0807-0

Keywords

Mathematics Subject Classification

Navigation