Sequential Quadratic Programming Methods for Large-Scale Problems

Computational Optimization and Applications

Volumn 7, Issue 1, 1997, Pages 127-142

  Murray, Walter ^a  

^a Stanford University   (United States)

Author keywords

Large scale optimization; Nonlinearly constrained minimization; Quadratic programming

Indexed keywords

LARGE SCALE PROBLEMS; SEQUENTIAL QUADRATIC PROGRAMMING METHOD;

CALCULATIONS; COMPUTER PROGRAMMING; MATHEMATICAL TECHNIQUES; MAXIMUM PRINCIPLE;

OPTIMIZATION;

EID: 0030683709     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008671829454     Document Type: Article

References (39)

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.
2. J.T. Betts and P.D. Frank, "A sparse nonlinear optimization algorithm," J. Optim. Theory and Applies., vol. 82, pp. 519-541, 1994.
3. L.T. Biegler, J. Nocedal, and C. Schmid, "A reduced Hessian method for large-scale constrained optimization," SIAM J. on Optimization, vol. 5, pp. 314-347, 1995.
4. M.C. Biggs, "On the convergence of some constrained minimization algorithms based on recursive quadratic programming," JIMA, vol. 21, pp. 67-81, 1978.
5. A. Buckley and A. LeNir, "QN-like variable storage conjugate gradients," Mathematical Programming, vol. 27, pp. 155-175, 1983.
6. A. Buckley and A. LeNir, "BBVSCG - A variable storage algorithm for function minimization," ACM Transactions on Mathematical Software, vol. 11, pp. 103-119, 1985.
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.
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.
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.
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.
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.
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äuser 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.
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.
28. M.W. Leonard, "Improved quasi-Newton methods for optimization," Ph.D. Thesis, Department of Mathematics, University of California, San Diego, 1995.
29. G. McCormick, "A modification of Armijo's step-size rule for negative curvature," Mathematical Programming, vol. 13, pp. 111-115, 1977.
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.
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.
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.
34. B.A. Murtagh and M.A. Saunders, "A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints," Mathematical Programming Study, vol. 16, pp. 84-117, 1982.
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.
37. D.B. Ponceleón, "Barrier methods for large-scale quadratic programming," Report SOL 91-2, Stanford University, Stanford, 1991.
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.