Global optimization using the branch-and-bound algorithm with a combination of lipschitz bounds over simplices;Globalusis optimizavimas šakų ir rėžių algoritmu su lipšico rėžių junginiu simplekse

Technological and Economic Development of Economy

Volumn 15, Issue 2, 2009, Pages 310-325

  Paulavičius, Remigijus ^a   Žilinskas, Julius ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Branch and bound algorithm; Global optimization; Lipschitz bound; Lipschitz optimization

Indexed keywords

EID: 70949098496     PISSN: 20294913     EISSN: 20294921     Source Type: Journal    
DOI: 10.3846/1392-8619.2009.15.310-325     Document Type: Article

References (46)

1. Dorsey, R. E.; Mayer, W. J. 1995. Genetic algorithms for estimation problems with multiple optima, nondifferentiability, and other irregular features, Journal of Business & Economic Statistics 13(1): 53-66.
2. Fair, R. C. 1971. A Short-Run Forecasting Model of the United States Economy. Heath Lexington Books.
3. Galperin, E. A. 1985. The cubic algorithm, Journal of Mathematical Analysis and Applications 112: 635-640.
4. Galperin, E. A. 1988. Precision, complexity, and computational schemes of the cubic algorithm, Journal of Optimization Theory and Applications 57: 223-238.
5. Gourdin, E.; Hansen, P.; Jaumard, B. 1994. Global optimization of multivariate Lipschitz functions: survey and computational comparison. Les Cahiers du GERAD.
6. Hansen, P.; Jaumard, B. 1995. Lipshitz optimization, in Horst, R. and Pardalos, P. M. (Eds.). Handbook of Global Optimization. Kluwer Academic Publishers, 404-493.
7. Hendrix, E. M. T.; Pinter, J. 1991. An application of Lipschitzian global optimization to product design, Journal of Global Optimization 2: 389-402.
8. Horst, R. 1988. Optimization with partition sets whose feasibility is not known. Application to concave minimization, reverse convex constraints, D. C.-programming and Lipschitzian optimization, Journal of Optimization Theory and Application 58: 11-37.
9. Horst, R.; Tuy, R. 1987. On the convergence of global methods in multiextremal optimization, Journal of Optimization Theory and Applications 54: 253-271.
10. Horst, R.; Tuy, H. 1988. Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities, Journal of Optimization Theory and Applications 58: 139-146.
11. Horst, R.; Tuy, H. 1993. Global optimization: deterministic approaches. Springer, 2 edition.
12. Jansson, C.; Knüppel, O. A. 1992. Global Minimization Method: The Multi-Dimensional Case. Technical Report TU Hamburg-Harburg.
13. Jerrell, M. E.; Campione, W. A. 2001. Global optimization of econometric functions, Journal of Global Optimization 20(3-4): 273-295.
14. Maddala, G. S. 1983. Limited-Dependent and Qualitative Variables in Econometrics. Cambridge University Press.
15. Maddala, G. S.; Nelson, F. D. 1974. Maximum likelihood methods for models of markets in disequilibrium, Econometrica 42(6): 1013-1030.
16. Madsen, K.; Žilinskas, J. 2000. Testing Branch-and-Bound Methods for Global Optimization. Technical Report IMM-REP-2000-05 Technical University of Denmark.
17. Mayne, D. Q.; Polak, E. 1984. Outer approximation algorithm for nondifferentiable optimization problems, Journal of Optimization Theory and Applications 42(1): 19-30.
18. Meewella, C. C.; Mayne, D. Q. 1988. An algorithm for global optimization of Lipshitz continuous functions, Journal of Optimization Theory and Applications 57: 307-323.
19. Mladineo, R. H. 1986. An algorithm for finding the global maximum of a multimodal, multivariate function, Mathematical Programming 34: 188-200.
20. Mladineo, R. H. 1992. Convergence rates of a global optimization algorithms, Mathematical Programming 54: 223-232.
21. Paulavičius, R.; Žilinskas, J. 2006. Analysis of different norms and corresponding Lipschitz constants for global optimization, Technological and Economic Development of Economy 12(4): 301-306.
22. Paulavičius, R.; Žilinskas, J. 2007. Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case, Information Technology and Control 36(4): 383-387.
23. Paulavičius, R.; Žilinskas, J. 2008a. Branch and bound with simplicial partitions and combination of Lipschitz bounds for global optimization, in Sakalauskas, L.; Weber, G. W. and Zavadskas, E. K. (Eds.). 20th International Conference EURO Mini Conference on Continuous Optimization and Knowledge-Based Technologies (EurOPT-2008), May 20-23, 2008, Neringa, Lithuania. Vilnius: Technika, 54-58.
24. Paulavičius, R.; Žilinskas, J. 2008b. Improved Lipschitz bounds with first norm for function values over multidimensional simplex, Mathematical Modelling and Analysis 13(4): 553-563.
25. Paulavičius, R.; Žilinskas, J. 2009. Parallel branch and bound algorithm with combination of Lipschitz bounds over multidimensional simplices for multicore computers, in Čiegis, R.; Henty, D.; Kågström, B. and Žilinskas, J. (Eds.). Parallel Scientific Computing and Optimization, Vol. 27 of Springer Optimization and Its Applications. Springer, 93-102.
26. Pinter, J. 1986a. Extended univariate algorithms for n-dimensional global optimization, Computing 36: 91-103.
27. Pinter, J. 1986b. Global optimization on convex sets, Operations Research Spektrum 8: 197-202.
28. Pinter, J. 1986c. Globally convergent methods for n-dimensional multiextremal optimization, Optimization 17: 187-202.
29. Pinter, J. 1988. Branch-and-bound algorithms for solving global optimization problems with Lipschitzian structure, Optimization 19: 101-110.
30. Piyavskii, S. A.1972. An algorithm for finding the absolute extremum of a function, Zh. Vychisl. Mat. mat. Fiz 12(4): 888-896.
31. Strongin, R. G. 1992. Algorithms for multiextremal mathematical programming problems employing the set of joint space-filling curves, Journal of Global Optimization 2: 357-378.
32. Tuy, H.; Horst, R. 1988. Convergence and restart in branch and bound algorithms for global optimization. Application to concave minimization and DC-optimization problems, Mathematical Programming 41: 161-183.
33. Wood, G. R. 1991. Multidimensional bisection applied to global optimization, Computers &Mathematics with Applications 21: 161-172.
34. Žilinskas, A.; Žilinskas, J. 2002. Global optimization based on a statistical model and simplicial partitioning, Computers & Mathematics with Applications 44(7): 957-967.
35. Žilinskas, A.; Žilinskas, J. 2006. On efficiency of tightening bounds in interval global optimization, Lecture Notes in Computer Science 3732: 197-205.
36. Žilinskas, A.; Žilinskas, J. 2009. Branch and bound algorithm for multidimensional scaling with city-block metric, Journal of Global Optimization 43(2-3): 357-372.
37. Žilinskas, J. 2000. Optimization of Lipschitzian functions by simplex-based branch and bound, Information Technology and Control 14(1): 45-50.
38. Žilinskas, J. 2005. Comparison of packages for interval arithmetic, Informatica 16(1): 145-154.
39. Žilinskas, J. 2006. Estimation of functional ranges using standard and inner interval arithmetic, Informatica 17(1): 125-136.
40. Žilinskas, J. 2007. Reducing of search space of multidimensional scaling problems with data exposing symmetries, Information Technology and Control 36(4): 377-382.
41. Žilinskas, J. 2008. Branch and bound with simplicial partitions for global optimization, Mathematical Modelling and Analysis 13(1): 145-159.
42. Žilinskas, J.; Bogle, I. D. L. 2003. Evaluation ranges of functions using balanced random interval arithmetic, Informatica 14(3): 403-416.
43. Žilinskas, J.; Bogle, I. D. L. 2004. Balanced random interval arithmetic, Computers & Chemical Engineering 28(5): 839-851.
44. Žilinskas, J.; Bogle, I. D. L. 2006. Balanced random interval arithmetic in market model estimation, European Journal of Operational Research 175(3): 1367-1378.
45. Žilinskas, J.; Bogle, I. D. L. 2007. A survey of methods for the estimation ranges of functions using interval arithmetic, in Törn, A. and Žilinskas, J. (Eds.). Models and Algorithms for Global Optimization, Vol. 4 of Springer Optimization and Its Applications. Springer, 97-108.
46. Žilinskas, J.; Bogle, I. D. L. 2009. Global optimization: Interval analysis and balanced interval arithmetic, in Floudas, C. A. and Pardalos, P. M. (Eds.). Encyclopedia of Optimization, 2nd edn., Springer, 1346-1350.