SNOPT: An SQP algorithm for large-scale constrained optimization

SIAM Journal on Optimization

Volumn 12, Issue 4, 2002, Pages 979-1006

  Gill, Philip E ^a   Murray, Walter ^a   Saunders, Michael A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Large scale optimization; Limited memory methods; Nonlinear inequality constraints; Nonlinear programming; Quasi Newton methods; Sequential quadratic programming

Indexed keywords

EID: 0036433588     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499350013     Document Type: Article

References (79)

1. R.H. Bartels, A penalty linear programming method using reduced-gradient basis-exchange techniques, Linear Algebra Appl., 29 (1980), pp. 17-32.
2. J.T. Betts and P.D. Frank, A sparse nonlinear optimization algorithm, J. Optim. Theory Appl., 82 (1994), pp. 519-541.
3. L.T. Biegler, J. Nocedal, and C. Schmid, A reduced Hessian method for large-scale constrained optimization, SIAM J. Optim., 5 (1995), pp. 314-347.
4. P.T. Boggs, A.J. Kearsley, and J.W. Tolle, A global convergence analysis of an algorithm for large-scale nonlinear optimization problems, SIAM J. Optim., 9 (1999), pp. 833-862.
5. P.T. Boggs, A.J. Kearsley, and J.W. Tolle, A practical algorithm for general large scale nonlinear optimization problems, SIAM J. Optim., 9 (1999), pp. 755-778.
6. P.T. Boggs and J.W. Tolle, Sequential quadratic programming, in Acta Numerica, Cambridge University Press, Cambridge, England, 1995, pp. 1-51.
7. A. Bondarenko, D. Bortz, and J.J. Morié, COPS: Large-Scale Nonlinearly Constrained Optimization Problems, Technical report ANL/MCS-TM-237, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1998; revised, 1999.
8. I. Bongartz, A.R. Conn, N.I.M. Gould, M.A. Saunders, and P.L. Toint, A Numerical Comparison Between the LANCELOT and MINOS Packages for Large-Scale Constrained Optimization, Report 97/13, Département de Mathématique, Facultés Universitaires de Namur, Namur, Belgium, 1997.
9. I. Bongartz, A.R. Conn, N.I.M. Gould, M.A. Saunders, and P.L. Toint, A Numerical Comparison Between the LANCELOT and MINOS Packages for Large-Scale Constrained Optimization: The Complete Numerical Results, Report 97/14, Département de Mathématique, Facultés Universitaires de Namur, Namur, Belgium, 1997.
10. I. Bongartz, A.R. Conn, N.I.M. Gould, and P.L. Toint, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
11. G.G. Brown and G.W. Graves, Elastic Programming: A New Approach to Large-Scale Mixed-Integer Optimization, presented at the ORSA/TIMS meeting, Las Vegas, NV, 1975.
12. G.G. Brown and G.W. Graves, The XS Mathematical Programming System, working paper, Department of Operations Research, Naval Postgraduate School, Monterey, CA, 1975.
13. A. Buckley and A. Lenir, QN-like variable storage conjugate gradients, Math. Programming, 27 (1983), pp. 155-175.
14. A. Buckley and A. Lenir, BBVSCG-A variable storage algorithm for function minimization, ACM Trans. Math. Software, 11 (1985), pp. 103-119.
15. R.H. Byrd, Robust Trust-Region Methods for Contstrained Optimization, presented at the SIAM Conference on Optimization, Houston, TX, 1987.
16. R.H. Byrd, J.C. Gilbert, and J. Nocedal, A trust region method based on interior point techniques for nonlinear programming, Math. Program., 89 (2000), pp. 149-185.
17. R.H. Byrd, M.E. Hribar, and J. Nocedal, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim., 9 (1999), pp. 877-900.
18. R.H. Byrd and J. Nocedal, An analysis of reduced Hessian methods for constrained optimization, Math. Programming, 49 (1991), pp. 285-323.
19. R.H. Byrd, J. Nocedal, and R.B. Schnabel, Representations of quasi-Newton matrices and their use in limited-memory methods, Math. Programming, 63 (1994), pp. 129-156.
20. A.R. Conn, Constrained optimization using a nondifferentiable penalty function, SIAM J. Numer. Anal., 10 (1973), pp. 760-784.
21. A.R. Conn, Linear programming via a nondifferentiable penalty function, SIAM J. Numer. Anal., 13 (1976), pp. 145-154.
22. A.R. Conn, N.I.M. Gould, and P.L. Toint, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Lecture Notes in Comput. Math. 17, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, 1992.
23. R.S. Dembo, S.C. Eisenstat, and T. Steihaug, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
24. J.E. Dennis, Jr., and R.B. Schnabel, A new derivation of symmetric positive definite secant updates, in Nonlinear Programming, 4 (1980), Academic Press, New York, 1981, pp. 167-199.
25. E. Dolan and J.J. Moré, Benchmarking optimization software with COPS, Math. Program., 91 (2002), pp. 201-213.
26. A. Drud, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, Math. Programming, 31 (1985), pp. 153-191.
27. I.S. Duff, MA28-A set of Fortran Subroutines for Sparse Unsymmetric Linear Equations, Report AERE R8730, Atomic Energy Research Establishment, Harwell, England, 1977.
28. S.K. Eldersveld, Large-Scale Sequential Quadratic Programming Algorithms, Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, 1991.
29. S.I. Feldman, D.M. Gay, M.W. Maimone, and N.L. Schryer, A Fortran-to-C Converter, Computing Science Technical report 149, AT & T Bell Laboratories, Murray Hill, NJ, 1990.
30. 1 penalty method for nonlinear constraints, in Numerical Optimization, P.T. Boggs, R.H. Byrd, and R.B. Schnabel, eds., SIAM, Philadelphia, 1985, pp. 26-40.
31. R. Fletcher, Optimization, 2nd ed., John Wiley and Sons, Chichester, New York, Brisbane, Toronto, Singapore, 1987.
32. R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program., 91 (2002), pp. 239-269.
33. R. Fourer, A simplex algorithm for piecewise-linear programming. I. Derivation and proof, Math. Programming, 33 (1985), pp. 204-233.
34. R. Fourer, A simplex algorithm for piecewise-linear programming. II. Finiteness, feasibility and degeneracy, Math. Programming, 41 (1988), pp. 281-315.
35. R. Fourer, A simplex algorithm for piecewise-linear programming. III. Computational analysis and applications, Math. Programming, 53 (1992), pp. 213-235.
36. R. Fourer, D.M. Gay, and B.W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, The Scientific Press, San Francisco, 1993.
37. J.C. Gilbert and C. Lemaréchal, Some numerical experiments with variable-storage quasi-Newton algorithms, Math. Programming, (1989), pp. 407-435.
38. P.E. Gill, G.H. Golub, W. Murray, and M.A. Saunders, Methods for modifying matrix factorizations, Math. Comput., 28 (1974), pp. 505-535.
39. P.E. Gill and M.W. Leonard, Limited-Memory Reduced-Hessian Methods for Unconstrained Optimization, Numerical Analysis Report NA 97-1, University of California, San Diego, La Jolla, CA, 1997.
40. P.E. Gill and W. Murray, The computation of Lagrange multiplier estimates for constrained minimization, Math. Programming, 17 (1979), pp. 32-60.
41. P.E. Gill, W. Murray, and M.A. Saunders, User's Guide for SNOPT 5.3: A Fortran Package for Large-Scale Nonlinear Programming, Numerical Analysis Report 97-5, Department of Mathematics, University of California, San Diego, La Jolla, CA, 1997.
42. P.E. Gill, W. Murray, and M.A. Saunders, User's Guide for SQOPT 5.3: A Fortran Package for Large-Scale Linear and Quadratic Programming, Numerical Analysis Report 97-4, Department of Mathematics, University of California, San Diego, La Jolla, CA, 1997.
43. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, Sparse matrix methods in optimization, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 562-589.
44. 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, Stanford, CA, 1986.
45. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, Maintaining LU factors of a general sparse matrix, Linear Algebra Appl., 88/89 (1987), pp. 239-270.
46. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, Inertia-controlling methods for general quadratic programming, SIAM Rev., 33 (1991), pp. 1-36.
47. 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, Amsterdam, 1992, pp. 101-128.
48. P.E. Gill, W. Murray, and M.H. Wright, Practical Optimization, Academic Press, London, New York, 1981.
49. D. Goldfarb, Factorized variable metric methods for unconstrained optimization, Math. Comput., 30 (1976), pp. 796-811.
50. S.P. Han, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Math. Programming, 11 (1976), pp. 263-282.
51. C.R. Hargraves and S.W. Paris, Direct trajectory optimization using nonlinear programming and collocation, J. Guidance, Control, and Dynamics, 10 (1987), pp. 338-348.
52. N. Higham, FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation, ACM Trans. Math. Software, 14 (1988), pp. 381-396.
53. M. Lalee, J. Nocedal, and T. Plantenga, On the implementation of an algorithm for large-scale equality constrained optimization, SIAM J. Optim., 8 (1998), pp. 682-706.
54. D.C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Math. Programming, 45 (1989), pp. 503-528.
55. J.L. Morales, A numerical study of limited memory BFGS methods, Appl. Math. Lett., to appear.
56. W. Murray, Sequential quadratic programming methods for large-scale problems, J. Comput. Optim. Appl., 7 (1997), pp. 127-142.
57. W. Murray and F.J. Prieto, A sequential quadratic programming algorithm using an incomplete solution of the subproblem, SIAM J. Optim., 5 (1995), pp. 590-640.
58. B.A. Murtagh and M.A. Saunders, Large-scale linearly constrained optimization, Math. Programming, 14 (1978), pp. 41-72.
59. B.A. Murtagh and M.A. Saunders, A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints, Math. Prog. Study, 16 (1982), pp. 84-117.
60. B.A. Murtagh and M.A. Saunders, MINOS 5.4 User's Guide, Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA, 1995.
61. E.O. Omojokun, Trust region algorithms for nonlinear equality and inequality constraints, Ph.D. thesis, Department of Computer Science, University of Colorado, Boulder, CO, 1989.
62. M. O'sullivan, New Methods for Dynamic Programming over an Infinite Time Horizon, Ph.D. thesis, Department of Management Science and Engineering, Stanford University, Stanford, CA, 2001.
63. M. O'sullivan and M.A. Saunders, Sparse LU Factorization with Threshold Complete Pivoting, SOL Report, Department of Management Science and Engineering, Stanford University, Stanford, CA, to appear.
64. M.J.D. Powell, Algorithms for nonlinear constraints that use Lagrangian functions, Math. Programming, 14 (1978), pp. 224-248.
65. M.J.D. Powell, The convergence of variable metric methods for nonlinearly constrained optimization calculations, in Nonlinear Programming, 3 (Proceedings of the Symposium, Special Interest Group Mathematical Programming, University of Wisconsin, Madison, WI, 1977), Academic Press, New York, 1978, pp. 27-63.
66. M.J.D. Powell, Variable metric methods for constrained optimization, in Mathematical Programming: The State of the Art (Bonn, 1982), A. Bachem, M. Grötschel, and B. Korte, eds., Springer, Berlin, 1983, pp. 288-311.
67. J.K. Reid, Fortran Subroutines for Handling Sparse Linear Programming Bases, Report AERE R8269, Atomic Energy Research Establishment, Harwell, England, 1976.
68. S.M. Robinson, A quadratically-convergent algorithm for general nonlinear programming problems, Math. Programming, 3 (1972), pp. 145-156.
69. R.W.H. Sargent and M. Ding, A new SQP algorithm for large-scale nonlinear programming, SIAM J. Optim., 11 (2000), pp. 716-747.
70. K. Schittkowski, NLPQL: A Fortran subroutine for solving constrained nonlinear programming problems, Ann. Oper. Res., 11 (1985/1986), pp. 485-500.
71. P. Spellucci, Han's method without solving QP, in Optimization and Optimal Control (Proceedings of the Conf. Math. Res. Inst., Oberwolfach, Oberwolfache-Walke, Germany, 1980), Springer, Berlin, 1981, pp. 123-141.
72. P. Spellucci, A new technique for inconsistent QP problems in the SQP method, Math. Methods Oper. Res., 47 (1998), pp. 355-400.
73. P. Spellucci, An SQP method for general nonlinear programs using only equality constrained subproblems, Math. Prog. Ser. A, 82 (1998), pp. 413-448.
74. n, J. Optim. Theory Appl., 14 (1974), pp. 453-476.
75. I.-B. Tjoa and L.T. Biegler, Simultaneous solution and optimization strategies for parameter estimation of differential algebraic equation systems, Ind. Eng. Chem. Res., 30 (1991), pp. 376-385.
76. K. Tone, Revisions of constraint approximations in the successive QP method for nonlinear programming problems, Math. Programming, 26 (1983), pp. 144-152.
77. G. Van der Hoek, Asymptotic properties of reduction methods applying linearly equality constrained reduced problems, Math. Prog. Study, 16 (1982), pp. 162-189.
78. R.J. Vanderbei and D.F. Shanno, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13 (1999), pp. 231-252.
79. C. Zhu, R.H. Byrd, P. Lu, and J. Nocedal, Algorithm 778: L-BFGS-B-Fortran subroutines for large-scale bound constrained optimization, ACM Trans. Math. Software, 23 (1997), pp. 550-560.