Analysis of performance for the DIRECT global optimization algorithm

• Autorzy: Borowik P. , Chwastek K.

Identyfikatory

DOI

10.5604/00326216.1210738

Warianty tytułu

PL

Analiza działania algorytmu optymalizacji globalnej DIRECT

• Języki publikacji: EN

Abstrakty

EN

The usefulness of the "branch-and-bound" algorithm for solving chosen optimization problems is considered in the paper. Simulations have been carried out for chosen benchmark tasks with different complexity and number of dimensions.

PL

W pracy dokonano oceny użyteczności algorytmu "branch-and-bound" do rozwiązywania wybranych zadań optymalizacji. Przeprowadzono symulacje dla wybranych zadań testowych o różnej złożoności i liczbie wymiarów.

Słowa kluczowe

EN

algorithm "branch-and-bound"; optimization; simulations

PL

algorytm branch-and-bound; optymalizacja; symulacje

• Wydawca: Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
• Czasopismo: Prace Instytutu Elektrotechniki
• Rocznik: 2016
• Tom: Z. 273
• Strony: 55--62
• Opis fizyczny: Bibliogr. 16 poz., rys.

Twórcy

autor

Borowik P.

• Czestochowa University of Technology, Faculty of Electrical Engineering, Al. Armii Krajowej 17, 42-200 Częstochowa

autor

Chwastek K.

• Czestochowa University of Technology, Faculty of Electrical Engineering, Al. Armii Krajowej 17, 42-200 Częstochowa

Bibliografia

• 1. Dixon L. C. W., Szégö G. P. (Eds.): Towards Global Optimisation 2. North-Holland Publishing Company, 1978.
• 2. Floudas C. A., Pardalos P. M.: A collection of test problems for constrained global optimization algorithms. Lecture Notes in Computer Science 455, Springer-Verlag, 1990.
• 3. Gurwitz Ch., Klein L., Lamba M.: A MATLAB Library of Test Functions for Unconstrained Optimization. Available as part of SolvOpt - the solver for local nonlinear optimization problems, ver. 1.1 by Kuntsevich A., Kappel F., Karl-Franzens University of Graz, 1997.
• 4. Oldenhuis R.: Many test functions for global optimizers: http://www.mathworks.com/matlabcentral/fileexchange/23147-many-testfunctions-for-global-optimizers, accessed February, 2015.
• 5. Jones D. R., Perttunen C. D., Stuckman B. E.: Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Application, 79 (1), pp. 157-181, 1993.
• 6. Finkel D. E.: DIRECT optimization algorithm user guide. Technical report, Center for Research in Scientific Computation, North Carolina State University, Raleigh, NC 27695-8205, 2003.
• 7. Finkel D. E.: Global optimization with the DIRECT algorithm. PhD Thesis, North Carolina State University, Raleigh, 2005.
• 8. Chwastek K.: The applications of fixed-point theorem in optimization problems. Archives of Electrical Engineering 61 (2), pp. 189-198, 2012.
• 9. Chiampi M., Chiarabaglio D., Repetto M.: A Jiles-Atherton and fixed-point combined technique for time periodic magnetic field problems with hysteresis. IEEE Transactions on Magnetics 31, 4306-4311, 1995.
• 10. Saitz J.: Newton-Raphson method and Fixed-Point technique in Finite Element computation of magnetic field problems in media with hysteresis. IEEE Transactions on Magnetics 35 (3), pp. 1398-1401, 1999.
• 11. Mockus J., Stašionis J.: On the experimental investigation of Pareto-Lipschitzian optimization. Lietuvos Matematikos Rinkinys. LMD Darbai 52, pp. 280-284, 2011.
• 12. Lovinson A., Hartikainen M. E.: On generalizing Lipschitz global methods for multiobjective optimization. Chapter in: Evolutionary multi-criterion optimization, Gaspar-Cunha A. et al. (Eds.), Lecture Notes in Computer Science, vol. 9019, pp. 264-278, Springer-Verlag, 2015.
• 13. Kvasov D. E., Sergeyev Y. D.: Deterministic approaches for solving practical black-box global optimization problems, Advances in Engineering Software 80, pp. 58-66, 2015.
• 14. Qunfeng Liu, Jianxiong Zhang, Fen Chen: Modified DIRECT algorithm for scaled global optimization problems, in: D. Gao et al. (Eds.), Advances in global optimization, Springer Proceedings in Mathematics & Statistics 95 (2015), doi: 10.1007/978-3-319-08377-3_40.
• 15. Niederreiter H., McCurley K.: Optimization of functions by quasi-random search methods. Computing 22 (2), pp. 119-123, 1979.
• 16. Rosenbrock H.: An automatic method for finding the greatest or least value of a function. Computer Journal 3, pp. 175-184, 1960.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.