Abstract
Entropy penalty functions have been successfully used in unconstrained and constrained nonlinear optimization problems. In this paper, we show that the interval majorant method can transform the entropy penalty method into an interval method that produces guaranteed results.
Similar content being viewed by others
References
Ben-Tal, A., Eiger, G., and Gershovitz, V.: Global Minimization by Reducing the Duality Gap, Math. Prog. 63 (1994), pp. 193-212.
Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, Basel, Hong Kong, 1992.
Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, John Wiley & Sons, Chichester, N.Y., 1988.
Shen, Z. and Eiermann, M. C.: Interval-Majorant Method and Global Optimization, Computing 43 (1989), pp. 85-92.
Shen, Z. and Zhu, Y.: An Interval Version of Shubert's Iterative Method for the Localization of the Global Maximum, Computing 38 (1987), pp. 275-280.
Templeman, A. B. and Li, X.: A Maximum Entropy Approach to Constrained Non-Linear Programming, Eng. Opt. 12 (1987), pp. 191-205.
Zhang, L. S. and Wolfe, M. A.: An Interval Algorithm for Nondifferentiable Global Optimization, Applied Mathematics and Computation 63 (1994), pp. 101-122.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhenyu, H. An Interval Entropy Penalty Method for Nonlinear Global Optimization. Reliable Computing 4, 15–25 (1998). https://doi.org/10.1023/A:1009994414947
Issue Date:
DOI: https://doi.org/10.1023/A:1009994414947