Skip to main content

Variable metric methods for constrained optimization

Numerical Algebra And Optimization

Part of the Lecture Notes in Mathematics book series (LNM,volume 704)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Biggs, M.C. (1972) "Constrained minimization using recursive equality quadratic programming" in Numerical methods for nonlinear optimization, ed. F.A. Lootsma, Academic Press (London).

    Google Scholar 

  • Buckley, A.G. (1975) "An alternate implementation of Goldfarb's minimization algorithm", Math. Prog., Vol. 8, pp. 207–231.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Colville, A.R. (1968) "A comparative study on nonlinear programming codes", Report No. 320-2949 (IBM New York Scientific Center).

    Google Scholar 

  • Dennis, J.E. and Moré, J.J. (1974) "A characterization of superlinear convergence and its application to quasi-Newton methods", Maths. of Comp., Vol. 28, pp. 549–560.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Fiacco, A.V. and McCormick, G.P. (1968) Nonlinear programming: sequential unconstrained minimization techniques, Wiley (New York).

    MATH  Google Scholar 

  • Fletcher, R. (1975) "An ideal penalty function for constrained optimization", J. Inst. Maths. Applics., Vol. 15, pp. 319–342.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Garcia Palomares, U.M. and Mangasarian, O.L. (1976) "Superlinearly convergent quasi-Newton algorithms for nonlinearly constrained optimization problems", Math. Prog., Vol. 11, pp. 1–13.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Han, S-P. (1975) "A globally convergent method for nonlinear programming", Report No. 75-257 (Dept. of Computer Science, Cornell University).

    Google Scholar 

  • Han, S-P. (1976) "Superlinearly convergent variable metric algorithms for general nonlinear programming problems", Math. Prog., Vol. 11, pp. 263–282.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Murray, W. (1972) Numerical methods for unconstrained optimization, Academic Press (London)

    Google Scholar 

  • Powell, M.J.D. (1976) "Algorithms for nonlinear constraints that use Lagrangian functions", presented at the Ninth International Symposium on Mathematical Programming, Budapest.

    Google Scholar 

  • Powell, M.J.D. (1977a) "A fast algorithm for nonlinearly constrained optimization calculations", presented at the 1977 Dundee conference on Numerical Analysis.

    Google Scholar 

  • Powell, M.J.D. (1977b) "The convergence of variable metric methods for nonlinearly constrained optimization calculations", presented at Nonlinear Programming Symposium 3, Madison, Wisconsin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Powell, M.J.D. (1979). Variable metric methods for constrained optimization. In: Glowinski, R., Lions, J.L., Laboria, I. (eds) Computing Methods in Applied Sciences and Engineering, 1977, I. Lecture Notes in Mathematics, vol 704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0063615

Download citation

  • DOI: https://doi.org/10.1007/BFb0063615

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09123-3

  • Online ISBN: 978-3-540-35411-6

  • eBook Packages: Springer Book Archive