Skip to main content
SpringerLink
Log in

Recursive quadratic programming algorithms and their convergence properties

  • Conference paper
  • First Online:
Numerical Analysis

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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. Sargent, R.W.H., “A Review of Optimization Methods for Nonlinear Problems”, in R.G. Squires and G.V. Reklaitis (Eds) “Computer Applications to Chemical Engineering”, ACS Symposium Series 124, 37–52, 1980.

    Google Scholar 

  2. Wilson, R.B., “A Simplicial Method for Convex Programming”, PhD Dissertation, Harvard University, 1963.

    Google Scholar 

  3. Han, S.P., “Superlinearly Convergent Variable-Metric Algorithms for General Nonlinear Programming Problems”, Math. Programming, 11(3), 236–282, (1976).

    MathSciNet  Google Scholar 

  4. Han, S.P., “A Globally Convergent Method for Nonlinear Programming”, JOTA, 22(3), 297–309, (1977).

    Article  MathSciNet  MATH  Google Scholar 

  5. Mayne, D.Q., “A Superlinearly Convergent Algorithm for Constrained Optimization Problems, in G.A. Watson (Ed) “Numerical Analysis Proceedings, Dundee 1979”, Lecture Notes in Mathematics, 773, 98–109, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  6. Chamberlain, R.M., C. Lemarechal, H.C. Pedersen, and M.J.D. Powell, “The Watchdog technique for Forcing Convergence in Algorithms for Constrained Optimization”, presented at Tenth International Symposium on Mathematical Programming, Montreal, August 1979.

    Google Scholar 

  7. Dennis, Jr., J.E., and H.F. Walker, “Local Convergence Theorems for Quasi-Newton Methods”, Rice University Report No. TR476-(141-171-163)-1, Houston, 1980.

    Google Scholar 

  8. Dennis, Jr., J.E., and H.F. Walker, “Convergence Theorems for Least-Change Secant Update Methods”, Rice University Report No. TR476-(141-171-163)-2, Houston, 1980.

    Google Scholar 

  9. Powell, M.J.D., “The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Calculations”, in O.L. Mangasarian, R.R. Meyer and S.M. Robinson (Eds), “Nonlinear Programming 3”, 27–64, Academic Press, New York 1978.

    Chapter  Google Scholar 

  10. Josephy, N.H., “Quasi-Newton Methods for Generalized Equations”, MRC Report No. 1966, University of Wisconsin-Madison, June 1979.

    Google Scholar 

  11. Sargent, R.W.H., “Reduced Gradient and Projection Methods for Nonlinear Programming”, in P.E. Gill and W. Murray (Eds), “Numerical Methods for Constrained Optimization”, Academic Press, London 1974.

    Google Scholar 

  12. Sargent, R.W.H., “On the Parametric Variation of Constraint Sets and Solutions of Minimization Problems”, presented at Tenth International Symposium on Mathematrical programming, Montreal, August 1979. To appear in Mathematical Programming Study 15.

    Google Scholar 

  13. Powell, M.J.D., “A Fast Algorithm for Nonlinearly Constrained Optimization Calculations”, in G.A. Watson (Ed) “Numerical Analysis—Proceedings of Biennial Conference, Dundee 1977”, Lecture Notes in Mathematics, 630, 144–159, Springer-Verlag, Berlin 1978.

    Google Scholar 

  14. Polak, E., R.W.H. Sargent and D.J. Sebastian, “On the Convergence of Sequential Minimization Algorithms”, JOTA, 14(4), 439–442, (1974).

    Article  MathSciNet  MATH  Google Scholar 

  15. Ortega, J.M., and W.C. Rheinboldt, “Iterative Solution of Nonlinear Equations in Several Variables”, Academic Press, New York, 1970.

    MATH  Google Scholar 

  16. Dennis, Jr., J.E., and J.J. Moré, “A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods”, Math. Comp. 28(126), 549–560, (1974).

    Article  MathSciNet  MATH  Google Scholar 

  17. Robinson, S.M., “Strongly Regular Generalized Equations”, Maths of Operations Research, 5(1), 43–62, (1980).

    Article  MathSciNet  MATH  Google Scholar 

  18. Rosen, J.B., “The Gradient Projection Method for Nonlinear Programming: Part II: Nonlinear Constraints”, J. SIAM, 9(4), 514–532 (1961).

    MATH  Google Scholar 

  19. Byrne, S.J., “Quadratic Programming Using Complementarity and Orthogonal Factorization”, PhD Thesis, University of London, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Chemical Engineering, Imperial College, SW7 2BY, London

    R.W.H. Sargent

Authors
  1. R.W.H. Sargent
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. P. Hennart

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Sargent, R. (1982). Recursive quadratic programming algorithms and their convergence properties. In: Hennart, J.P. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092975

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11193-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation