Skip to main content

Advertisement

Log in

On an inexact trust-region SQP-filter method for constrained nonlinear optimization

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

A class of trust-region algorithms is developed and analyzed for the solution of optimization problems with nonlinear equality and inequality constraints. These algorithms are developed for problem classes where the constraints are not available in an open, equation-based form, and constraint Jacobians are of high dimension and are expensive to calculate. Based on composite-step trust region methods and a filter approach, the resulting algorithms do not require the computation of exact Jacobians; only Jacobian vector products are used along with approximate Jacobian matrices. With these modifications, we show that the algorithm is globally convergent. Also, as demonstrated on numerical examples, our algorithm avoids direct computation of exact Jacobians and has significant potential benefits on problems where Jacobian calculations are expensive.

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.

Fig. 1

Similar content being viewed by others

References

  1. Byrd, R.: Robust trust region methods for constrained optimization, Houston, USA. In: Third SIAM Conference on Optimization (1987)

  2. Byrd, R.H., Gilbert, J.C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Progr. 89, 149–185 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Conn, A.R., Gould, N.I., Toint, P.L.: LANCELOT: A Fortran Package for Large-scale Nonlinear Optimization (release A). Springer Series in Computational Mathematics, vol. 17. Springer Science & Business Media, New York (1992)

    MATH  Google Scholar 

  5. Conn, A.R., Gould, N.I., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

  6. Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J. Opt. 20, 387–415 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Curtis, F.E., Schenk, O., Wächter, A.: An interior-point algorithm for large-scale nonlinear optimization with inexact step computations. SIAM J. Sci. Comput. 32(6), 3447–3475 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fletcher, R., Gould, N., Leyffer, S., Toint, P., Wächter, A.: Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim. 13(3), 635–659 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Griewank, A., Walther, A.: Evaluating Derivatives, Principles and Techniques of Algorithmic Differentiation, 2nd edn. SIAM (2008)

  11. Griewank, A., Walther, A.: On constrained optimization by adjoint-based quasi-Newton methods. Optim. Methods Softw. 17, 869–889 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Heinkenschloss, M., Ridzal, D.: A matrix-free trust-region sqp method for equality constrained optimization. Technical Report TR11-17, CAAM, Rice University (2011)

  13. Jiang, L., Biegler, L.T., Fox, G.: Optimization of pressure swing adsorption systems for air separation. AIChE J. 49, 1140–1157 (2003)

    Article  Google Scholar 

  14. Omojokun, E.: Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD Thesis, Department of Computer Science, University of Colorado (1989)

  15. Vetukuri, S.R., Biegler, L.T., Walther, A.: An inexact trust-region algorithm for the optimization of periodic adsorption processes. Ind. Eng. Chem. Res. 49, 12004–12013 (2010)

    Article  Google Scholar 

  16. Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Progr. 106(1), 25–57 (2006)

    Article  MATH  Google Scholar 

  17. Walther, A., Griewank, A.: Getting started with ADOL-C. In: Naumann, U., Schenk, O. (eds.) Combinatorial Scientific Computing, pp. 181–202. Chapman-Hall CRC Computational Science, London (2012)

    Chapter  Google Scholar 

  18. Walther, A., Vetukuri, S.R.R., Biegler, L.T.: A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints. Optim. Methods Softw. 27(2), 373–389 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ziems, J.C., Ulbrich, S.: Adaptive multilevel inexact SQP methods for PDE-constrained optimization. SIAM J. Optim. 21(1), 1–40 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrea Walther.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Walther, A., Biegler, L. On an inexact trust-region SQP-filter method for constrained nonlinear optimization. Comput Optim Appl 63, 613–638 (2016). https://doi.org/10.1007/s10589-015-9793-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-015-9793-x

Keywords

Navigation