×

Reducing transformation and global optimization. (English) Zbl 1256.65054

The alienor method of dimension reduction has been essentially developed for solving global optimization problems of coercive functions without constraints or of functions verifying other conditions and with fairly simple constraints. This method is based on the generation of a specific curve in the feasible set which allows to transform the optimization problem in a hyper-rectangle of a Euclidean space into an optimization in a compact interval of the real line. The authors give new results on the alienor method of dimension reduction considering a more general case.
Some results of the paper are tested for accuracy through numerical experiments. The results of the paper will help to solve global optimization problems arising in industry applications.

MSC:

65K05 Numerical mathematical programming methods
90C90 Applications of mathematical programming
90C26 Nonconvex programming, global optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ali, M. M.; Kajee-Bagdadi, Z., Improved versions of the LEDE algorithm for constrained global optimization, Applied Mathematics and Computation, 215, 2, 431-440 (2009) · Zbl 1173.65325
[2] Ammar, H.; Cherruault, Y., Approximation of a several variables function by a one variable function and applications to global optimization, Mathematical and Computer Modelling, 18, 2, 17-21 (1993) · Zbl 0797.41029
[3] Bendiab, O.; Cherruault, Y., Divanu: a new method for global optimization in dimension \(n\), International Journal of Bio-Medical Computing, 38, 177-180 (1995)
[4] Cherruault, Y., Optimisation. Optimisation, Méthodes locales et globales (1999), Presses Universitaire de France · Zbl 0701.90083
[5] Cherruault, Y.; Guillez, A., Une méthode pour la recherche du minimum global d’une fonctionnelle, C.R.A.S, Paris, Série I, 296, 175-178 (1983) · Zbl 0525.65047
[6] Evtushenko, Yu. G.; Malkova, V. U.; Stanevichyus, A. A., Parallelization of the global extremum searching process, Automation and Remote Contro, 68, 5, 787-798 (2007) · Zbl 1151.68390
[7] Evtushenko, Yu. G.; Malkova, V. U.; Stanevichyus, A. A., Parallel global optimization of functions of several variables, Computational Mathematics and Mathematical Physics, 49, 2, 246-260 (2009) · Zbl 1199.65197
[8] Jiao, H.; Guo, Y.; Shen, P., Global optimization of generalized linear fractional programming with nonlinear constraints, Applied Mathematics and Computation, 183, 2, 717-728 (2006) · Zbl 1111.65052
[9] Horst, R., A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Journal of Optimization Theory and Applications, 51, 2, 271-291 (1986) · Zbl 0581.90073
[10] Horst, R.; Tuy, H., Global Optimization, Deterministic Approach (1993), Springer-Verlag: Springer-Verlag Berlin
[11] Huang, Z. H.; Miao, X. H.; Wang, P., A revised cut-peak function method for box constrained continuous global optimization, Applied Mathematics and Computation, 194, 1, 224-233 (2007) · Zbl 1193.90173
[12] Lagaris, I. E.; Tsoulos, I. G., Stopping rules for box-constrained stochastic global optimization, Applied Mathematics and Computation, 197, 2, 622-632 (2008) · Zbl 1135.65330
[13] Mora, G.; Cherruault, Y., Characterization and generation of \(α\)-dense curves, Computers & Mathematics with Applications, 33, 9, 83-91 (1997) · Zbl 0893.90177
[14] Mora, G.; Cherruault, Y.; Ziadi, A., Functional equations generating space-densifying curves, Computers & Mathematics with Applications, 39, 45-55 (2000) · Zbl 0954.39016
[15] Piyavskii, S. A., An algorithm for finding the absolute minimum for a function, Theory of Optimal Solutions, 2, 13-24 (1967)
[16] Rahal, M.; Ziadi, A., A new extension of Piyavskii’s method to Hölder functions of several variables, Applied Mathematics and Computation, 197, 478-488 (2008) · Zbl 1154.65050
[17] Sagan, H., Space-filling Curves (1994), Springer-Verlag: Springer-Verlag New York · Zbl 0806.01019
[18] Shubert, B. O., A sequential method seeking the global maximum of a function, SIAM, Journal of Numerical Analysis, 9, 3, 379-388 (1972) · Zbl 0251.65052
[19] Törn, A.; Zilinska, A., Global Optimization (1988), Springer-Verlag: Springer-Verlag New york
[20] Ziadi, A.; Cherruault, Y., Generation of \(α\)-dense Curves in a cube of \(R^n\), Kybernetes, 27, 4, 416-425 (1998) · Zbl 0933.65067
[21] Ziadi, A.; Cherruault, Y., Generation of \(α\)-dense curves and application to global optimization, Kybernetes, 29, 1, 71-82 (2000) · Zbl 0978.90090
[22] Ziadi, A.; Cherruault, Y.; Mora, G., The existence of \(α\)-dense curves with minimal length in a metric space, Kybernetes, 29, 2, 219-230 (2000) · Zbl 0978.90091
[23] Ziadi, A.; Cherruault, Y.; Mora, G., Global optimization, a new variant of the alienor method, Computers & Mathematics with Applications, 41, 63-71 (2001) · Zbl 0980.90069
[24] Ziadi, A.; Guettal, D.; Cherruault, Y., Global optimization: Alienor mixed method with Piyavskii-Shubert technique, Kybernetes, 34, 7/8, 1049-1058 (2005) · Zbl 1130.90405
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.