Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

Journal of Global Optimization

Volumn 49, Issue 2, 2011, Pages 185-212

  Nataraj, P S V ^a   Arounassalame, M ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Bernstein polynomials; Constrained global optimization; Pruning; Subdivision

Indexed keywords

BENCH-MARK PROBLEMS; BERNSTEIN POLYNOMIAL; BRANCH-AND-PRUNE ALGORITHMS; CONSISTENCY ALGORITHMS; CONSTRAINED GLOBAL OPTIMIZATION; CUT-OFF; EXISTING METHOD; MULTIVARIATE POLYNOMIAL; PERFORMANCE METRICS; PRUNING; SEARCH REGION; SUBDIVISION;

CONSTRAINED OPTIMIZATION; GLOBAL OPTIMIZATION; MULTIVARIABLE SYSTEMS; POLYNOMIALS;

ALGORITHMS;

EID: 79951551428     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9485-0     Document Type: Article

References (30)

1. Hedar, A-R., Ahmed, A.: Studies on Metaheuristics for continuous global optimization problems. Ph.D. dissertation, Kyoto University, Kyoto, Japan (2004)
2. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.: Revising hull and box consistency. In: Proceedings of the sixteenth international conference on logic programming (ICLP'99), The MIT Press, Las Cruces, USA, pp. 230-244 (1999)
3. Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global optimization algorithms. Springer, London (1990)
4. Floudas C.A., Pardalos P.M.: Handbook of Test problems in Local and Global Optimization. Kluwer, The Netherlands (1999)
5. Garloff J.: Convergent bounds for range of multivariate polynomials. Interval mathematics. In: Nickel, K (eds) Lecture Notes in Computer Science, vol. 212, pp. 37-56. Springer, Berlin (1985)
6. J. Garloff 1993 The Bernstein algorithm Interval Comput. 2 154 168
7. Garloff J.: Solving strict polynomial inequalities by Bernstein expansion. The use of symbolic methods in control system analysis and design. In: Munro, N. (eds) IEE Control Engineering Series, vol. 56, pp. 339-352. Springer, Berlin (1999)
8. Global Library, Avaiable from http://www.gamsworld.org/global/globallib.
9. Global Library, Avaiable from http://www.gamsworld.org/global/globallib. (Pubitemid 34254784)
10. L. Granvilliers F. Benhamou 2006 Algorithm 852: real paver: an interval solver using constraint satisfaction techniques ACM Trans. Math. Softw. 32 1 138 156 10.1145/1132973.1132980 (Pubitemid 43924960)
11. Hansen E., Walster G.W.: Global Optimization Using Interval Analysis. Marcel Dekker Inc, New York (2004)
12. Henrion, D., Lasserre J.B.: GloptiPoly: global optimization with polynomials with MATLAB and SeDuMi, version 2.3.0 (2006)
13. Horst R., Pardalos P.M.: Handbook of Global Optimization. Kluwer, The Netherlands (1995)
14. Jaulin L., Kieffer M., Didrit O.: Applied Interval Analysis. Springer, London (2001)
15. Kearfott R.B.: Rigorous Global Search: Continuous problems. Kluwer, Dordrecht (1996)
16. Y. Lebbah C. Michel M. Rueher 2007 An efficient and safe framework for solving optimization problems J. Comput. Appl. Math. 199 372 377 10.1016/j.cam.2005.08.037 (Pubitemid 44557009)
17. H.L. Li C.T. Chang 1998 An approximate approach of global optimization for polynomial programming problems Eur J Oper Res 107 625 632 10.1016/S0377-2217(96)00310-4
18. 3 algorithm for robust performances analysis in presence of mixed parametric and dynamic perturbations. In: Proceedings of 31st Conference on Decision and Control, Tucson, Arizona, pp. 128-133 (1992)
19. MATLAB Reference Guide.: MATLAB version 6.1, The Mathworks Inc., Natick, MA (2001)
20. P.S.V. Nataraj K. Kotecha 2005 An improved interval global optimization algorithm using higher order inclusion function forms J. Global Optim. 32 1 35 63 10.1007/s10898-004-5906-2 (Pubitemid 40952253)
21. P.S.V. Nataraj K. Kotecha 2004 Global optimization with higher order inclusion function forms part 1: a combined Taylor-Bernstein form Reliab. Comput. 10 1 27 44 10.1023/B:REOM.0000003995.08805.2a
22. P.S.V. Nataraj M. Arounassalame 2007 A new subdivision algorithm for bernstein polynomial approach to global optimization Int. J. Automat. Comput. 4 4 342 352 10.1007/s11633-007-0342-7 (Pubitemid 47551848)
23. Ratschek H., Rokne J.: Computer Methods for the Range of Functions. Ellis Horwood Limited Publishers, Chichester (1984)
24. D. Ratz T. Csendes 1995 On the selection of subdivision directions in interval Branch-and-Bound methods for global optimization J. Global Optim. 7 2 183 207 10.1007/BF01097060
25. Rump, S.M.: INTLAB-Interval Laboratory, Developments in Reliable Computing. Kluwer, Dordrecht, pp. 77-104 (1999)
26. Shaswathi Ray, S.: A new approach to range computation of polynomials using the Bernstein form. Ph.D. dissertation, Indian Institute of Technology Bombay, Mumbai, India (2006)
27. Stahl. V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.D. dissertation, University of linz (2005)
28. R. Vaidyanathan M. Ed-halwagi 1994 Global optimization of nonconvex nonlinear programs via interval analysis Comput. Chem. Eng. 18 10 889 897 10.1016/0098-1354(94)E0032-I
29. Venkataraman R.: Applied Optimization with MATLAB Programming. Wiley, London (2001)
30. M. Zettler J. Garloff 1998 Robustness analysis of polynomials with polynomial parameter dependency using bernstein expansion IEEE Trans. Autom. Contr. 43 5 425 431 10.1109/9.661615 (Pubitemid 128737364)