Skip to main content

Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

  • Chapter
Multiscale Optimization Methods and Applications

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 82))

Summary

A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher et al (SIAM J. Opt. 13(3), 2002, pp. 653–659) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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, 24, 1152–1170, 1987.

    Article  MathSciNet  Google Scholar 

  2. A. R. Conn, N. I. M. Gould, and Ph. L. Toint. Trust-Region Methods. Number 01 in ‘MPS-SIAM Series on Optimization’. SIAM, Philadelphia, USA, 2000.

    Google Scholar 

  3. A. R. Conn, N. I. M. Gould, A. Sartenaer, and Ph. L. Toint. Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints. SIAM Journal on Optimization, 3(1), 164–221, 1993.

    Article  MathSciNet  Google Scholar 

  4. J. E. Dennis, M. El-Alem, and K. A. Williamson. A trust-region approach to nonlinear systems of equalities and inequalities. SIAM Journal on Optimization, 9(2), 291–315, 1999.

    Article  MathSciNet  Google Scholar 

  5. M. El-Hallabi and R. A. Tapia. An inexact trust-region feasible-point algorithm for nonlinear systems of equalities and inequalities. Technical Report TR95-09, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, USA, 1995.

    Google Scholar 

  6. R. Fletcher and S. Leyffer. User manual for filterSQP. Numerical Analysis Report NA/181, Department of Mathematics, University of Dundee, Dundee, Scotland, 1998.

    Google Scholar 

  7. R. Fletcher and S. Leyffer. Nonlinear programming without a penalty function. Mathematical Programming, 91(2), 239–269, 2002.

    Article  MathSciNet  Google Scholar 

  8. R. Fletcher, N. I. M. Gould, S. Leyffer, Ph. L. Toint, and A. Wächter. Global convergence of trust-region SQP-filter algorithms for nonlinear programming. SIAM Journal on Optimization, 13(3), 635–659, 2002.

    Article  MathSciNet  Google Scholar 

  9. R. Fletcher, S. Leyffer, and Ph. L. Toint. On the global convergence of a SLP-filter algorithm. Technical Report 98/13, Department of Mathematics, University of Namur, Namur, Belgium, 1998.

    Google Scholar 

  10. R. Fletcher, S. Leyffer, and Ph. L. Toint. On the global convergence of a filter-SQP algorithm. SIAM Journal on Optimization, 13(1), 44–59, 2002b.

    Article  MathSciNet  Google Scholar 

  11. E. O. Omojokun. Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD thesis, University of Colorado, Boulder, Colorado, USA, 1989.

    Google Scholar 

  12. A. Sartenaer. Automatic determination of an initial trust region in nonlinear programming. SIAM Journal on Scientific Computing, 18(6), 1788–1803, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  13. Ph. L. Toint. Global convergence of a class of trust region methods for non-convex minimization in Hilbert space. IMA Journal of Numerical Analysis, 8(2), 231–252, 1988.

    MATH  MathSciNet  Google Scholar 

  14. Ph. L. Toint. A non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints. Mathematical Programming, 77(1), 69–94, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Ulbrich. On the superlinear local convergence of a filter-SQP method. Mathematical Programming, Series B, 100(1), 217–245, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Vardi. A trust region algorithm for equality constrained minimization: convergence properties and implementation. SIAM Journal on Numerical Analysis, 22(3), 575–591, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Wächter and L. T. Biegler. Global and local convergence of line search filter methods for nonlinear programming. Technical Report CAPD B-01-09, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, USA, 2001. Available on http://www.optimization-online.org/DB_HTML/2001/08/367.html.

    Google Scholar 

  18. Y. Yuan. Trust region algorithms for nonlinear programming. in Z. C. Shi, ed., ‘Contemporary Mathematics’, Vol. 163, pp. 205–225, Providence, Rhode-Island, USA, 1994. American Mathematical Society.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Gould, N.I.M., Toint, P.L. (2006). Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming. In: Hager, W.W., Huang, SJ., Pardalos, P.M., Prokopyev, O.A. (eds) Multiscale Optimization Methods and Applications. Nonconvex Optimization and Its Applications, vol 82. Springer, Boston, MA. https://doi.org/10.1007/0-387-29550-X_5

Download citation

Publish with us

Policies and ethics