Sequential Quadratic Programming Methods for Large-Scale Problems | Computational Optimization and Applications Skip to main content
Springer Nature Link
Log in

Sequential Quadratic Programming Methods for Large-Scale Problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Sequential quadratic (SQP) programming methodsare the method of choice when solving small or medium-sized problems. Sincethey are complex methods they are difficult (but not impossible) to adapt tosolve large-scale problems. We start by discussing the difficulties that needto be addressed and then describe some general ideas that may be used toresolve these difficulties. A number of SQP codes have been written to solve specific applications and there is a general purposed SQP code called SNOPT,which is intended for general applications of a particular type. These aredescribed briefly together with the ideas on which they are based. Finally wediscuss new work on developing SQP methods using explicit second derivatives.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.T. Betts and W.P. Huffman, "Path constrained trajectory optimization using sparse sequential quadratic programming," J. of Guidance, Control, and dynamics, vol. 16, no. 1, pp. 59–68, 1993.

    Google Scholar 

  2. J.T. Betts and P.D. Frank, "A sparse nonlinear optimization algorithm,"J. Optim. Theory and Applics., vol. 82, pp. 519–541, 1994.

    Google Scholar 

  3. L.T. Biegler, J. Nocedal, and C. Schmid, "Areduced Hessian method for large-scale constrained optimization,"SIAM J. on Optimization, vol. 5, pp. 314–347, 1995.

    Google Scholar 

  4. M.C. Biggs, "On the convergence of some constrained minimization algorithms based on recursive quadratic programming,"JIMA, vol. 21, pp. 67–81, 1978.

    Google Scholar 

  5. A. Buckley and A. LeNir, "QN-like variable storage conjugate gradients,"Mathematical Programming, vol. 27, pp. 155–175, 1983.

    Google Scholar 

  6. A. Buckley and A. LeNir, "BBVSCG-A variable storage algorithm for function minimization,"ACMTransactions on Mathematical Software, vol. 11, pp. 103–119, 1985.

    Google Scholar 

  7. R.C. Burchett, H.H. Happ, and D.R. Vierath, "Quadratically convergent optimal power flow,"IEEE Transactions on Power Apparatus and Systems, vol. PAS-103, pp. 3267–3275, 1984.

    Google Scholar 

  8. R.H. Byrd, P. Lu, and J. Nocedal, "A limited memory algorithm for bound constrained optimization,"Report NAM 07, EECS Department, Northwestern University, 1993.

  9. R.H. Byrd, J. Nocedal, and R.B. Schnabel, "Representations of quasi-Newton matrices and their use in limited memory methods,"Mathematical Programming, vol. 63, pp. 129–156, 1994.

    Google Scholar 

  10. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "An introduction to the structure of large-scale nonlinear optimization problems and the LANCELOT project," in Computing Methods in Applied Sciences and Engineering, R. Glowinski and A. Lichnewsky (Eds.), SIAM, Philadelphia, pp. 42–54, 1990.

  11. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "An introduction to the standard data input format (SDIF) for nonlinear mathematical programming problems," Département de Mathématique, Facultés Universitaires de Namur, Technical Report 91/8, 1991.

  12. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "LANCELOT: A fortran package for large-scale nonlinear optimization (Release A),"Lecture Notes in Computation Mathematics 17, Springer Verlag: Berlin, Heidelberg, New York, London, Paris and Tokyo, 1992.

    Google Scholar 

  13. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “Large-scale nonlinear constrained optimization: A current survey,” Technical Report 94/1, Département de Mathématique, Facultés Universitaires de Namur, 1994.

  14. G. Di Pillo, F. Facchinei, and L. Grippo, "An (RQP) algorithm using a differentiable exact penalty function for inequality constrained problems,"Mathematical Programming, pp. 49–68, 1992.

  15. S.K. Eldersveld, "Large-scale sequential quadratic programming algorithms,"Stanford, Report SOL 92-4, Department of Operations Research, Stanford University, 1992.

  16. M.C. Fenelon, "Preconditioned conjugate-gradient-type methods for large-scale unconstrained optimization,"Ph.D. Thesis, Department of Operations Research, Stanford University, 1981.

  17. R. Fletcher, "An optimal positive definite update for sparse Hessian matrices," SIAM J. on Optimization, vol. 5, pp. 192–218, 1995.

    Google Scholar 

  18. J.Ch. Gilbert and C. Lemaréchal, “Some numerical experiments with variable-storage quasi-Newton algorithms,” Mathematical Programming, pp. 407–435, 1989.

  19. P.E. Gill and W. Murray, "Conjugate-gradient methods for large-scale nonlinear optimization,"CA, Report SOL 79–15, Department of Operations Research, Stanford University, Palo Alto, 1979.

    Google Scholar 

  20. P.E. Gill, W. Murray, and M.A. Saunders, "Large-scale SQP methods and their application in trajectory optimization," Control Applications of Optimization, International Series of Numerical Mathematics, R. Bulirsch and D. Kraft (Eds.), Birkh¨auser Basel, vol. 115, pp. 29–42, 1994.

  21. P.E. Gill, W. Murray, and M.A. Saunders, "An SQP algorithm of large-scale optimization," Report SOL 95-x, Department of Operations Research, Stanford University (to appear).

  22. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, "User's guide for NPSOL (version 4.0): A fortran package for nonlinear programming,"Report SOL 86–2, Department of Operations Research, Stanford University, 1986.

  23. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, "Inertia-controlling methods for quadratic programming,"SIAM Review, vol. 33, pp. 1–33, 1988.

    Google Scholar 

  24. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, "Constrained nonlinear programming," in Optimization, Handbooks in Operations Research and Management Science, G.L. Nemhauser and A.H.G. Rinnooy Kan (Eds.), Elsevier, vol. 1, Ch. III, pp. 171–210, 1989.

  25. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, "A Schur-complement method for sparse quadratic programming," in Reliable Numerical Computation, M.G. Cox and S. Hammarling (Eds.), Oxford University Press, pp. 113–138, 1990.

  26. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, "Some theoretical properties of an augmented Lagrangian merit function," in Advances in Optimization and Parallel Computing, P.M. Pardalos (Ed.), North-Holland, pp. 101–128, 1992.

  27. S.P. Han, "Superlinearly convergent variable metrix algorithms for general nonlinear programming problems," Math. Prog., vol. 11, pp. 263–282, 1976.

    Google Scholar 

  28. M.W. Leonard, "Improved quasi-Newton methods for optimization," Ph.D. Thesis, Department of Mathematics, University of California, San Diego, 1995.

    Google Scholar 

  29. G. McCormick, "A modification of Armijo's step-size rule for negative curvature," Mathematical Programming, vol. 13, pp. 111–115, 1977.

    Google Scholar 

  30. J.J. Moré and D.C. Sorensen, “Newton's method,” in Studies in Numerical Analysis, G.H. Golub (Ed.) (Mathematical Association of America), pp. 29–82, 1984.

  31. W. Murray, "An algorithm for constrained minimization," in Optimization, R. Fletcher (Ed.), Academic Press: London and New York, pp. 247–258, 1969.

    Google Scholar 

  32. W. Murray and F.J. Prieto, "A sequential quadratic programming algorithm using an incomplete solution of the subproblem," in SIAM J. on Optimization, vol. 5, pp. 589–639, 1995.

    Google Scholar 

  33. W. Murray and F.J. Prieto, "A second-derivative method for nonlinearly constrained optimization," Technical Report Report SOL 95-3, Department of Operations Research, Stanford University, Stanford, 1995.

    Google Scholar 

  34. B.A. Murtagh and M.A. Saunders, "A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints,", vol. 16, pp. 84–117, 1982.

    Google Scholar 

  35. B.A. Murtagh and M.A. Saunders, MINOS 5.4 user's guide, Report SOL 83-20R, Department of Operations Research, Stanford University, 1993.

  36. J. Nocedal, "Updating quasi-Newton matrices with limited storage," Mathematics of Computation, vol. 35, pp. 773–782, 1980.

    Google Scholar 

  37. D.B. Ponceléon, “Barrier methods for large-scale quadratic programming,” Report SOL 91-2, Stanford University, Stanford, 1991.

    Google Scholar 

  38. M.J.D. Powell, "A fast algorithm for nonlinearly constrained optimization calculations," in Numerical Analysis, Dundee 1977, Lecture Notes in Mathematics 630, G.A. Watson (Ed.), Springer-Verlag, pp. 144–157, 1978.

  39. U.T. Ringertz, "A mathematical programming approach to structural optimization," Report No. 88–24, Dept. of Aeronautical Structures and Materials, The Royal Institute of Technology, Stockholm, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Optimization Laboratory, Department of Operations Research, Stanford University, USA

    Walter Murray

Authors
  1. Walter Murray
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murray, W. Sequential Quadratic Programming Methods for Large-Scale Problems. Computational Optimization and Applications 7, 127–142 (1997). https://doi.org/10.1023/A:1008671829454

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008671829454

Search

Navigation