Skip to main content

A fast algorithm for nonlinearly constrained optimization calculations

  • Conference paper
  • First Online:
Numerical Analysis

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

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 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.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

  • 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 

  • Biggs, M.C. (1975) "Constrained minimization using recursive quadratic programming: some alternative subproblem formulations" in Towards global optimization, eds. L.C.W. Dixon and G.P. Szegö, North-Holland Publishing Co. (Amsterdam).

    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. (1977) "Quasi-Newton methods, motivation and theory", SIAM Review, Vol. 19, pp. 46–89.

    Article  MathSciNet  MATH  Google Scholar 

  • Fletcher, R. (1970) "A Fortran subroutine for quadratic programming", Report No. R6370 (A.E.R.E., Harwell).

    Google Scholar 

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

    Article  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", Mathematical Programming, Vol. 11, pp. 263–282.

    Article  MathSciNet  MATH  Google Scholar 

  • Powell, M.J.D. (1969) "A method for nonlinear constraints in minimization problems" in Optimization, ed. R. Fletcher, 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. (1977) "The convergence of variable metric methods for nonlinearly constrained optimization calculations", presented at Nonlinear Programming Symposium 3, Madison, Wisconsin.

    Google Scholar 

  • Rosenbrock, H.H. (1960) "An automatic method for finding the greatest or the least value of a function", Computer Journal, Vol. 3, pp. 175–184.

    Article  MathSciNet  Google Scholar 

  • Sargent, R.W.H. (1974) "Reduced-gradient and projection methods for nonlinear programming" in Numerical methods for constrained optimization, eds. P.E. Gill and W. Murray, Academic Press (London).

    Google Scholar 

Download references

Authors

Editor information

G. A. Watson

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Powell, M.J.D. (1978). A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067703

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08538-6

  • Online ISBN: 978-3-540-35972-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics