Skip to main content

Sequential Quadratic Programming in Banach Spaces

  • Conference paper
Advances in Optimization

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 382))

Abstract

We analyze a sequential quadratic programming method for optimization problems in Banach spaces. We give sufficient conditions for local quadratic convergence of the method. The results are applied to various optimization problems.

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. Alt W., “The Lagrange-Newton method for infinite-dimensional optimization problems,” Numer. Fund. Anal, and Optimiz. 11 (1990), 201–224.

    Article  Google Scholar 

  2. Alt W., “Stability for parameter estimation in two point boundary value problems,” Optimization 22 (1991), 99–111.

    Article  Google Scholar 

  3. Alt W., “Parametric programming with applications to optimal control and sequential quadratic programming,” Bayreuther Mathematische Schriften 35 (1991), 1–37.

    Google Scholar 

  4. Alt W., “Local stability of solutions to differentiable optimization problems in Banach spaces,” to appear in JOTA.

    Google Scholar 

  5. Ekeland I., Temam R., “Convex analysis and variational problems,” North Holland, Amsterdam-Oxford, 1976.

    Google Scholar 

  6. Fletcher R., “Practical methods of optimization,” John Wiley & Sons, New York, Second edition, 1987.

    Google Scholar 

  7. Ioffe A.D., Tihomirov V.M., “Theory of extremal problems,” North Holland, Amsterdam-New York-Oxford, 1979.

    Google Scholar 

  8. Ito K., Kunisch K., “Sensitivity analysis of solutions to optimization problems in Hilbert spaces with applications to optimal control and estimation,” Preprint, 1989.

    Google Scholar 

  9. Kelley C.T., Wright S. J., “Sequential quadratic programming for certain parameter identification problems,” Preprint 1990.

    Google Scholar 

  10. Langenbach A., “Monotone Potentialoperatoren,” Springer Verlag, Berlin-Heidelberg-New York, 1977.

    Book  Google Scholar 

  11. Levitin E. S., Polyak B.T., “Constrained minimization methods,” USSR J. Comput. Math. and Math. Phys. 6 (1966), 5, 1–50.

    Article  Google Scholar 

  12. Machielsen K. C. P., “Numerical solution of optimal control problems with state constraints by sequential quadratic programming in function space,” CWI Tract 53, Amsterdam, 1987.

    Google Scholar 

  13. Malanowski K., “Second order conditions and constraint qualifications in stability and sensitivity analysis of solutions to optimization problems in Hilbert spaces,” to appear in Appl. Math. Optim.

    Google Scholar 

  14. Maurer H., Zowe J., “First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems,” Mathematical Programming 16 (1979), 98–110.

    Article  Google Scholar 

  15. Penot J.P., “On regularity conditions in mathematical programming,” MathematicalProgramming Study 19 (1982), 167–199.

    Article  Google Scholar 

  16. Robinson S.M., “Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms,” Mathematical Programming 7 (1974), 1–16.

    Article  Google Scholar 

  17. Robinson S.M., “Stability theory for systems of inequalities, Part II: Differentiable nonlinear systems,” SIAM J. Num. Anal. 13 (1976), 497–513.

    Article  Google Scholar 

  18. Robinson S.M., “Regularity and stability for convex multivalued functions,” Mathematics of Operations Research 1 (1976), 130–143.

    Article  Google Scholar 

  19. Robinson S. M., “Strongly regular generalized equations,” Mathematics of Operatios Research 5 (1980), 43–62.

    Article  Google Scholar 

  20. Robinson S.M., “Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity,” MathematicalProgramming Study 30 (1987), 45–66.

    Article  Google Scholar 

  21. Stoer J., “Principles of sequential quadratic programming methods for solving nonlinear programs,” in: K. Schittkowski (ed.), Computational Mathematical Programming, Nato ASI Series, Vol. F15, 1985, 165–207.

    Chapter  Google Scholar 

  22. Stoer J., Bulirsch R., “Introduction to numerical analysis,” Springer Verlag, New York-Heidelberg-Berlin, 1983.

    Google Scholar 

  23. Wilson R. B., “A simplicial algorithm for concave programming,” Ph. D. Dissertation, Harvard Univ. Graduate School of Business Administration, 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alt, W. (1992). Sequential Quadratic Programming in Banach Spaces. In: Oettli, W., Pallaschke, D. (eds) Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51682-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-51682-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55446-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics