Skip to main content

Variable Metric Methods for Constrained Optimization

  • Chapter
Book cover Mathematical Programming The State of the Art

Abstract

Variable metric methods solve nonlinearly constrained optimization problems, using calculated first derivatives and a single positive definite matrix, which holds second derivative information that is obtained automatically. The theory of these methods is shown by analysing the global and local convergence properties of a basic algorithm, and we find that superlinear convergence requires less second derivative information than in the unconstrained case. Moreover, in order to avoid the difficulties of inconsistent linear approximations to constraints, careful consideration is given to the calculation of search directions by unconstrained minimization subproblems. The Maratos effect and relations to reduced gradient algorithms are studied briefly.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. M. C. Bartholomew-Biggs, “Recursive quadratic programming methods for nonlinear constraints”, in Nonlinear Optimization 1981, ed. M. J. D. Powell ( Academic Press, London, 1982 ) pp. 213–221.

    Google Scholar 

  2. M. C. Biggs, “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, 1975 ) pp. 341–349.

    Google Scholar 

  3. P. T. Boggs, J. W. Tolle and P. Wang, “On the local convergence of quasi-Newton methods for constrained optimization”, SIAM Journal on Control and Optimization, Vol. 20 (1982) pp. 161–171.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. M. Chamberlain, “Some examples of cycling in variable metric algorithms for constrained optimization”, Mathematical Programming, Vol. 16 (1979) pp. 378–383.

    Article  MathSciNet  MATH  Google Scholar 

  5. R. M. Chamberlain, The Theory and Application of Variable Metric Methods to Constrained Optimization Problems, Ph. D. Dissertation (University of Cambridge, 1980 ).

    Google Scholar 

  6. R. M. Chamberlain, C. Lemaréchal, H. C. Pedersen and M. J. D. Powell, “The watchdog technique for forcing convergence in algorithms for constrained optimization”, Mathematical Programming Study, Vol. 16 (1982) pp. 1–17.

    Article  MATH  Google Scholar 

  7. T. F. Coleman and A. R. Conn, “Nonlinear programming via an exact penalty function: asymptotic analysis”, Report CS-80-30 (University of Waterloo, 1980 ).

    Google Scholar 

  8. T. F. Coleman and A. R. Conn, “Nonlinear programming via an exact penalty function: global analysis”, Report CS-80-31 (University of Waterloo, 1980 ).

    Google Scholar 

  9. J. E. Dennis and J. J. Moré, “A characterization of superlinear convergence and its application to quasi-Newton methods”, Mathematics of Computation, Vol. 28 (1974) pp. 549–560.

    Article  MathSciNet  MATH  Google Scholar 

  10. L. C. W. Dixon, “On the convergence properties of variable metric recursive quadratic programming methods”, Report NOC-llO (The Hatfield Polytechnic, 1980 ).

    Google Scholar 

  11. R. Fletcher, Practical Methods of Optimization, Vol. 1, Unconstrained Optimization ( John Wiley & Sons, Chichester, 1980 ).

    MATH  Google Scholar 

  12. R. Fletcher, Practical Methods of Optimization, Vol. 2, Constrained Optimization (John Wiley & Sons, Chichester, 1981 ).

    MATH  Google Scholar 

  13. R. Fletcher, “Numerical experiments with an exact L1 penalty function method”, in Nonlinear Programming 4, eds. O. L. Mangasarian, R. R. Meyer and S. M. Robinson ( Academic Press, New York, 1981 ) pp. 99–129.

    Google Scholar 

  14. R. Fletcher, “Methods for nonlinear constraints”, in Nonlinear Optimization 1981, ed. M. J. D. Powell ( Academic Press, London, 1982 ) pp. 185–211.

    Google Scholar 

  15. P. E. Gill and W. Murray, “The computation of Lagrange multiplier estimates for constrained minimization”, Mathematical Programming, Vol. 17 (1979) pp. 32–60.

    Article  MathSciNet  MATH  Google Scholar 

  16. P. E. Gill, W. Murray and M. H. Wright, Practical Optimization ( Academic Press, London, 1981 ).

    MATH  Google Scholar 

  17. S. P. Han, “A globally convergent method for nonlinear programming”, Journal of Optimization Theory and Applications, Vol. 22 (1977) pp. 297–309.

    Article  MathSciNet  MATH  Google Scholar 

  18. N. Maratos, Exact Penalty Function Algorithms for Finite Dimensional and Control Optimization Problems, Ph. D. Dissertation ( Imperial College, University of London, 1978 ).

    Google Scholar 

  19. D. Q. Mayne and E. Polak, “A superlinearly convergent algorithm for constrained optimization problems”, Mathematical Programming Study, Vol. 16 (1982) pp. 45–61.

    Article  MathSciNet  MATH  Google Scholar 

  20. W. Murray and M. H. Wright, “Computation of the search direction in constrained optimization algorithms”, Mathematical Programming Study, Vol. 16 (1982) pp. 62–83.

    Article  MathSciNet  MATH  Google Scholar 

  21. M. J. D. Powell, “A fast algorithm for nonlinearly constrained optimization algorithms”, in Numerical Analysis, Dundee, 1977, Lecture Notes in Mathematics 630, ed. G. A. Watson ( Springer-Verlag, Berlin, 1978 ) pp. 144–157.

    Google Scholar 

  22. M. J. D. Powell, “The convergence of variable metric methods for nonlinearly constrained optimization calculations”, in Nonlinear Programming 3, eds. O. L. Mangasarian, R. R. Meyer and S. M. Robinson ( Academic Press, New York, 1978 ) pp. 27–63.

    Google Scholar 

  23. M. J. D. Powell, “Extensions to subroutine VF02AD”, in System Modeling and Optimization, Lecture Notes in Control and Information Sciences 38, eds. R. F. Drenick and F. Kozin ( Springer-Verlag, New York, 1982 ) pp. 529–538.

    Google Scholar 

  24. M. J. D. Powell, “VMCWD: a Fortran subroutine for constrained optimization”, Report DAMTP-1982/NA4 (University of Cambridge, 1982 ).

    Google Scholar 

  25. K. Schittkowski, Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 183 ( Springer-Verlag, Berlin, 1980 ).

    Google Scholar 

  26. K. Schittkowski, “On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function”, Report SOL-82-4 (Stanford University, 1982 ).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Powell, M.J.D. (1983). Variable Metric Methods for Constrained Optimization. In: Bachem, A., Korte, B., Grötschel, M. (eds) Mathematical Programming The State of the Art. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68874-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68874-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-68874-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics