Abstract
Bounding Hessians are defined and an O(n 2) method of obtaining optimal bounding Hessians from interval Hessians is presented. They are applied to a framework of an adaptive second derivative covering method for global optimization, which is presented here. Also, bounding Hessians can be used for reformulation of very general global optimization problems into several useful forms for which there are existing algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. S. Adjiman, I. P. Andronlakis, C. D. Maranas, and C. A. Floudas. A global optimization method, αBB. Presented at the Third Workshop on Global Optimization, Szeged, Hungary, December 1995.
Claire S. Adjman and Christodoulos A. Floudas. Rigorous convex underestimators for general twice-differentiable problems. Journal of Global Optimization, To appear.
I. P. Androulakis, C. D. Maranas, and C. A. Floudas. αBB: A global optimization method for general constained nonconvex ploblems. Journal of Global Optimization, 7:337–363, 1995.
W. P. Baritompa and A. Cutler. Accelerations for global optimization covering methods using second derivatives. Journal of Global Optimization, 4:329–341, 1994.
L. Breiman and A. Cutler. A deterministic algorithm for global optimization. Mathematical Programming, 58:179–199, 1993.
C. A. Floudas and V. Visweswaran. A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory. Computers and chemical engineering, 14(12):1397–1417, 1990.
Eldon Hansen. Global optimization unsing interval analysis—the multidimensional case. Numerische Mathematik, 34:247–270, 1980.
Reiner Horst and Hoang Tuy. Global optimization: Deterministic Approaches. Springer-Verlag, second, revised edition, 1993.
W. B. Liu and C. A. Floudas. A remark on the GOP algorithm for global optimization. Journal of Global Optimization, 3:519–521, 1993.
Ramon E. Moore. Interval analysis. Series in Automatic Computation. Prentice-Hall, Englewood Cliffs, N. J., 1966.
Hoang Tuy. D.C. optimization: Theory, methods and algorithms. In Reiner Horst and Panos M. Pardalos, editors, Handbook of Global Optimization, volume 2 of Nonconvex optimization and its applications, pages 149–216. Kluwer Academic Publishers, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stephens, C. (1997). Interval and Bounding Hessians. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M. (eds) Developments in Global Optimization. Nonconvex Optimization and Its Applications, vol 18. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2600-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2600-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4768-0
Online ISBN: 978-1-4757-2600-8
eBook Packages: Springer Book Archive