scientific article; zbMATH DE number 1484309

From MaRDI portal
Publication:4493256





A new approach for solving the problem of global optimization that uses interval arithmetic was developed in eighties years by E. Hansen, S. Sengupta, H. Ratschek, J. Rokne and other authors [see, e.g., the books of \textit{H. Ratschek} and \textit{J. Rokne}, New computer methods for global optimization, Ellis Horwood, Chichester (1988; Zbl 0648.65049) and \textit{E. R. Hansen}, Global optimization using interval analysis, Pure Appl. Math. (New York, Marcel Dekker) 165 (1992; Zbl 0762.90060)]. In the present paper a new algorithm, based on this technique, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. To improve the bounds of interval functions appearing in the considered problem, the authors introduce the cord-slope form of Taylor's expansion. This form is used to eliminate parts of the current subbox that cannot contain the global minimum. An eight-steps algorithm, consisting of suitable direct and conditional tests, is presented and its convergence to a globally \(\varepsilon\)-optimal solution is given. The proposed algorithm finds only one such solution. This algorithm can be easily modified to find all globally optimal solutions. Computational results, including a comparison with results of \textit{S. Sengupta} [Global nonlinear constrained optimization, Ph.D. Theses, Washington State University (1981)] are given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493256)