Skip to main content

A Multiplier-Free, Reduced Hessian Method for Process Optimization

  • Chapter

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 93))

Abstract

Process optimization problems typically consist of large systems of algebraic equations with relatively few degrees of freedom. For these problems the equation system is generally constructed by linking individual process models together; solution of these models is frequently effected by calculation procedures that exploit their equation structure. This paper describes a tailored optimization strategy for these process models that is based on reduced Hessian Successive Quadratic Programming (SQP). In particular, this approach only requires Newton steps from the process models and their ‘sensitivities,’ and does not require the calculation of Lagrange multipliers for the equality constraints. It can also be extended to large-scale systems through the use of sparse matrix factorizations. The algorithm has the same superlinear and global properties as the reduced Hessian method developed in [4]. Here we summarize these properties and demonstrate the performance of the multiplier-free SQP method through numerical experiments.

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

Buying options

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
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ascher, U. and R. Spiteri, Collocation software for boundary value differential-algebraic equations, SIAM J. Scient. Stat. Comput., to appear (1995).

    Google Scholar 

  2. Andersen, P.M., F. Genovese and J. Perregard, Manual for Steady State Simulator, SEPSIM, Institut for Kemiteknik, DTH, Lyngby, Denmark (1991).

    Google Scholar 

  3. Biegler, L.T., Convergence analysis for the multiplier free reduced Hessian method, EDRC Technical Report 06–203–95 (1995).

    Google Scholar 

  4. Biegler, L.T., J. Nocedal and C. Schmid, A reduced Hessian method for large-scale constrained optimization, SIAM J. Opt., 5, 2, pp. 314–347 (1995).

    Article  MathSciNet  MATH  Google Scholar 

  5. Bongartz, I., A.R. Conn, N. Gould, and P.L. Toint, Cute: Constrained and Unconstrained Testing Environment, TOMS, 21, 1, pp. 123–160 (1995).

    Article  MATH  Google Scholar 

  6. Byrd, R. H., and J. Nocedal, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal., 26, pp. 727–739 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  7. Byrd, R.H., and J. Nocedal, An analysis of reduced Hessian methods for constrained optimization, Math. Programming, 49, pp. 285–323 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  8. Chamberlain, R., C. Lemarechal, H.C. Pedersen and M.J.D. Powell, The watchdog technique for forcing convergence in algorithms for constrained optimization, Math. Programming Studies, 16, pp. 1–17 (1982).

    Article  MathSciNet  MATH  Google Scholar 

  9. Conn, A.R., Constrained optimization using a nondifferentiable penalty function, SIAM J. Num. Anal., 13, pp. 145–154 (1973).

    Article  MathSciNet  Google Scholar 

  10. Dennis, J.E., and R.B. Schnabel, Numerical methods for unconstrained optimization and nonlinear equations, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1983.

    MATH  Google Scholar 

  11. Douglas, J.M., Conceptual Design of Chemical Processes, McGraw Hill (1988).

    Google Scholar 

  12. Fletcher, R, Practical Methods of Optimization( second edition ), John Wiley and Sons, Chichester, 1987.

    MATH  Google Scholar 

  13. Goldfarb, D. and A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs, Math. Programming, 27, p. 1 (1983).

    Article  MathSciNet  MATH  Google Scholar 

  14. Gulliksson, M. Algorithms for nonlinear least squares with applications to orthogonal regression, UMINF-178. 90, University of Umea, Sweden (1990).

    Google Scholar 

  15. Han, S.P., A globally convergent method for nonlinear programming, Journal on Optimization Theory and Application, 22 /3, pp. 297–309 (1977).

    Article  MATH  Google Scholar 

  16. Hock, W., and K. Schittkowski, Test examples for nonlinear programming codes, Lecture notes in economics and mathematical systems 187, Springer-Verlag, Berlin (1981).

    Google Scholar 

  17. HYSIM User’s Manual, Hyprotech, Ltd., Calgary, Alta. (1994).

    Google Scholar 

  18. Kisala, T.P., Trevino-Lozano, R.A., Boston, J.F., Britt, H.I., and Evans, L.B., Sequential modular and simultaneous modular strategies for process flowsheet optimization, Computers and Chemical Engineering, 11, 6, pp. 56779 (1987).

    Article  Google Scholar 

  19. McKetta, J.J. (ED.), Encyclopedia of Chemical Processing and Design, vol. 4, Dekker, New York, 1977, p. 182 (1977).

    Google Scholar 

  20. Murtagh, B. and M. Saunders, MINOS User’s Guide, Report SOL 83–20R (1983).

    Google Scholar 

  21. J. Nocedal and M.L. Overton, Projected Hessian updating algorithms for non-linearly constrained optimization, SIAM Journal on Numerical Analysis, 22, pp. 821–850 (1985).

    Article  MathSciNet  MATH  Google Scholar 

  22. Pantelides, C.C., SPEEDUP-recent advances in process simulation, Computers and Chemical Engineering, 12, 7, pp. 745–55 (1988).

    Article  Google Scholar 

  23. Piela, P.C., Epperly, T.G., Westerberg, K.M., Westerberg, A.W., ASCEND: an object-oriented computer environment for modeling and analysis, Computers and Chemical Engineering, 15, 1, pp. 53–72 (1991).

    Article  Google Scholar 

  24. Sargent, R.W.H., Survey of SQP methods, this workshop (1995).

    Google Scholar 

  25. Schmid, C. and L.T. Biegler, Quadratic Programming Methods for Tailored Reduced Hessian SQP, Computers and Chemical Engineering, 18/9, pp. 817–832 (1994).

    Article  Google Scholar 

  26. Schmid, C. and L.T. Biegler, A Simultaneous Approach for Flowsheet Optimization with Existing Modeling Procedures, Trans. I. Chem. Eng., 72A, pp. 382–388 (1994).

    Google Scholar 

  27. Tanartkit, P. and L.T. Biegler, Stable Decomposition for Dynamic Optimization, I & EC Research, 34, p. 1253 (1995).

    Article  Google Scholar 

  28. Tanartkit, P., and L.T. Biegler, Reformulating III-Conditioned DAE Optimization Problems, I & EC Research, 35, 6, pp. 1853–1865 (1996).

    Article  Google Scholar 

  29. Verneuil,V., Process simulator of 1991 for the chemical and petroleum industry, Proceedings of the 1986 Summer Computer Simulation Conference, R. Crosbie and P. Luker (eds.), pp. 311–12 (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Biegler, L.T., Schmid, C., Ternet, D. (1997). A Multiplier-Free, Reduced Hessian Method for Process Optimization. In: Biegler, L.T., Coleman, T.F., Conn, A.R., Santosa, F.N. (eds) Large-Scale Optimization with Applications. The IMA Volumes in Mathematics and its Applications, vol 93. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1960-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1960-6_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7356-1

  • Online ISBN: 978-1-4612-1960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics