Skip to main content

Subspace Search Methods for Large Scale Nonlinear Optimization

  • Chapter
Scientific Computing in Chemical Engineering

Abstract

Nonlinear optimization is one of the crucial topics in the numerical treatment of chemical engineering problems. Numerical optimization deals with the problems of solving systems of nonlinear equations or minimizing nonlinear functionals (with respect to side conditions). In this article we present a new method for unconstrained minimization which is suitable as well in large scale as in bad conditioned problems. The method is based on a true multi-dimensional modeling of the objective function in each iteration step. The scheme allows the incorporation of more given or known information into the search than in common line search methods.

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

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. Dembo, R.S., Steihaug, T.: Truncated Newton Algorithms for Large-Scale Unconstrained Optimization, Math. Prog 26, pp. 190–212, 1983.

    Article  Google Scholar 

  2. Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Minimization and Nonlinear Equations, Prentice Hall, 1983.

    Google Scholar 

  3. Grippo, L., Lampariello, F., Lucidi, S.: A Non-monotone Line Search Technique for Newton’s Method, SIAM J. Num. Anal., 23, pp. 707–718, 1986.

    Article  Google Scholar 

  4. Mackens, W., Rascher-Friesenhausen, R.: On Curved Line Searches, Technical Report E-4, Inst, of Appl. Math., Univ. Hamburg, sep 1994.

    Google Scholar 

  5. Mackens, W., Rascher-Friesenhausen, R.: An Improved Newton Method, Technical Report, Inst, of Appl. Math., Univ. Hamburg, to appear.

    Google Scholar 

  6. Moré, Garbow, Hillstroem: Testing Unconstrained Optimization Software, ACM Toms 7, pp. 17–41, mar 1981.

    Article  Google Scholar 

  7. Rascher-Friesenhausen, R.: Step Size Conditions for Curved Line Searches, Technical Report E-7, Inst, of Appl. Math., Univ. Hamburg, may 1995.

    Google Scholar 

  8. Rascher-Friesenhausen, R.: Unrestringierte Minimierung mit Unterraum Suchmethoden, PhD Thesis, Dept. of Math., Univ. Hamburg, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rascher-Friesenhausen, R. (1996). Subspace Search Methods for Large Scale Nonlinear Optimization. In: Keil, F., Mackens, W., Voß, H., Werther, J. (eds) Scientific Computing in Chemical Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80149-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80149-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-80151-8

  • Online ISBN: 978-3-642-80149-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics