Abstract
The reduced Hessian SQP algorithm presented in Biegler et al. [SIAM J. Optimization, Vol. 5, no. 2, pp. 314–347, 1995.] is developed in this paper into a practical method for large-scale optimization. The novelty of the algorithm lies in the incorporation of a correction vector that approximates the cross term ZTWYpY. This improves the stability and robustness of the algorithm without increasing its computational cost. The paper studies how to implement the algorithm efficiently, and presents a set of tests illustrating its numerical performance. An analytic example, showing the benefits of the correction term, is also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.T. Betts and P.D. Frank, “A sparse nonlinear optimization algorithm,” JOTA, vol. 82, pp. 519-541, 1994.
L.T. Biegler, “Optimization strategies for complex process models,” Advances in Chemical Engineering, vol. 8, p. 197, 1992.
L.T. Biegler, J. Nocedal, and C. Schmid, “A reduced Hessian method for large-scale constrained optimization,” SIAM J. Optimization, vol. 5, no. 2, pp. 314-347, 1995.
L.T. Biegler, C. Schmid, and D. Ternet, in A Multiplier-Free, Reduced Hessian Method For Process Optimization, Large-Scale Optimization with Applications, Part II: Optimal Design and Control, L.T. Biegler, T.F. Coleman, A.R. Conn, and F.N. Santosa (Eds.), Springer Verlag, p. 101, 1997.
P.T. Boggs, J.W. Tolle, and A.J. Wang, “A Practical Algorithm for General Large Scale Nonlinear Optimization Problems,” Internal Report, National Institute of Standards, 1994.
I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “CUTE: Constrained and Unconstrained Testing Environment,” Research Report, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1993.
R.H. Byrd, “An example of irregular convergence in some constrained optimization methods that use the projected Hessian,” Math. Programming, vol. 32, pp. 232-237, 1985.
R.H. Byrd and J. Nocedal, An analysis of reduced Hessian methods for constrained optimization, Math. Programming, vol. 49, pp. 285-323, 1991.
R.M. Chamberlain, C. Lemarechal, H.C. Pedersen, and M.J.D. Powell, “The watchdog technique for forcing convergence in algorithms for constrained optimization,” Math. Programming Studies, vol. 16, pp. 1-17, 1982.
T.F. Coleman and A.R. Conn, “On the local convergence of a quasi-Newton method for the nonlinear programming problem,” SIAM J. Numer. Anal., vol. 21, pp. 755-769, 1984.
I.S. Duff, A.M. Erisman, and J.K. Reid, Direct Methods for Sparse Matrices, Clarendon Press: Oxford, 1986.
S.K. Eldersveld, Large-Scale Sequential Quadratic Programming Algorithms, Ph.D. Thesis, Department of Operations Research, Stanford University, Stanford, CA, 1991.
R. Fletcher, “An exact penalty for nonlinear programming with inequalities,” Math. Programming, vol. 5, pp. 129-150, 1973.
R. Fletcher, Practical Methods of Optimization, 2nd edition, John Wiley and Sons: Chichester, 1987.
D. Gabay, “Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization,” Math. Programming Studies, vol. 16, pp. 18-44, 1982.
J.C. Gilbert, “On the local and global convergence of a reduced quasi-Newton method,” Optimization, vol. 20, pp. 421-450, 1989.
J.C. Gilbert, “Maintaining the positive definiteness of the matrices in reduced Hessian methods for equality constrained optimization,” Math. Programming, vol. 50, pp. 1-28, 1991.
P.E. Gill, W. Murray, and M. Saunders, “An SQP Algorithm for Large Scale Optimization,” Working Paper, EESOR Department, Stanford University, 1996.
P.E. Gill, W. Murray, and M.H. Wright, Practical Optimization, Academic Press: London, 1981.
M. Gulliksson, Algorithms for Nonlinear Least Squares with Applications to Orthogonal Regression, UMINF-178.90, University of Umea, Sweden, 1990.
C.B. Gurwitz and M.L. Overton, “SQP methods based on approximating a projected Hessian matrix,” SIAM J. Sci. Stat. Comp., vol. 10, pp. 631-653, 1989.
Harwell Subroutine Library, A catalogue of subroutines (release 12). AEA Technology, Harwell, Oxfordshire, England, 1995.
W. Hock and K. Schittkowski, “Test Examples for Nonlinear Programming Codes,” in Lecture Notes in Economics and Mathematical Systems, vol. 187, Springer Verlag: Berlin, 1981.
M. Lalee, J. Nocedal, and T. Plantenga, “On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization,” SIAM J. Optimization, submitted.
W. Murray and F.J. Prieto, “A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem,” Technical Report, Department of Operations Research, Stanford University, 1992.
J. Nocedal and M.L. Overton, “Projected Hessian updating algorithms for nonlinearly constrained optimization,” SIAM J. Numer. Anal., vol. 22, pp. 821-850, 1985.
E.O. Omojokun, Trust Region Algorithms for Optimization with Nonlinear Equality and Inequality Constraints, Ph.D. Dissertation, University of Colorado, 1991.
C.E. Orozco, Large-Scale Shape Optimization: Numerical Methods, Parallel Algorithms and Applications to Aerodynamic Design, Ph.D. Dissertation, Carnegie Mellon University, 1993.
E.R. Panier and A.L. Tits, “On combining feasibility, descent and superlinear convergence in inequality constrained optimization,” Mathematical Programming, vol. 59, 261-276, 1993.
Schmid, C. and L.T. Biegler, “Quadratic Programming Methods for Tailored Reduced Hessian SQP,” Computers and Chemical Engineering, vol. 18, no. 9, p. 817, 1994.
Tanartkit, P. and L.T. Biegler, “Stable decomposition for dynamic optimization,” I & EC Research, vol. 34, p. 1253, 1995.
D.J. Ternet and L.T. Biegler, “Recent Improvements to a Multiplier Free Reduced Hessian Successive Quadratic Programming Algorithm,” Computers and Chemical Engineering, to appear.
Ph.L. Toint, “An assessment of non-monotone line search techniques for unconstrained optimization,” SIAM Journal on Scientific and Statistical Computing, 17, vol. 3, pp. 725-739, 1996.
S.Vasantharajan and L.T. Biegler, “Large-scale decomposition for successive quadratic programming,” Comp. Chem. Engr., vol. 12, no. 11, p. 1087, 1988.
Y. Xie, Reduced Hessian Algorithms for Solving Large-Scale Equality Constrained Optimization Problems, Ph.D. Dissertation, Department of Computer Science, University of Colorado, Boulder, 1991.
Y. Yuan, “An only 2-step Q-superlinear convergence example for some algorithms that use reduced Hessian approximations,” Math. Programming, vol. 32, pp. 224-231, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Biegler, L.T., Nocedal, J., Schmid, C. et al. Numerical Experience with a Reduced Hessian Method for Large Scale Constrained Optimization. Computational Optimization and Applications 15, 45–67 (2000). https://doi.org/10.1023/A:1008723031056
Issue Date:
DOI: https://doi.org/10.1023/A:1008723031056