An algorithm for global optimization using the Taylor-Bernstein form as inclusion function

Journal of Global Optimization

Volumn 24, Issue 4, 2002, Pages 417-436

  Nataray, P S V ^a   Kotecha, K ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b G H PATEL COLLEGE OF ENGINEERING AND TECHNOLOGY   (India)

Author keywords

Bernstein polynomials; Global optimization; Interval analysis

Indexed keywords

EID: 84867951856     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1021296315884     Document Type: Article

References (24)

1. Berz, M. and Hoefkens, J. (2001), COSY INFINITY Version 8.1 Programming Manual, Technical Report MSUCL-1196, National Superconducting Cyclotron Laboratory, Michigan State University, East Lansing, MI 48824.
2. M. Berz G. Hoffstatter 1998 Computation and Application of Taylor Polynomials with Interval Remainder Bounds Reliable Computing 4 83 97
3. G.T. Cargo O. Shisha 1966 The Bernstein Form of a Polynomial J. Research of NBS 70B 79 81
4. T. Csendes D. Ratz 1997 Subdivision Direction Selection in Interval Methods for Global Optimization SIAM J. Numerical Analysis 34 922 938
5. J. Garloff 1993 The Bernstein Algorithm Interval Computations 2 155 168
6. Garloff, J. and Smith, A.P. (2000), Investigation of a Subdivision Based Algorithm for Solving Systems of Polynomial Equations, in Proc. of the 3rd World Congress of Nonlinear Analysts (WCNA 2000), Catania, Sicily, Italy.
7. Garloff, J. and Smith, A.P. (2001), Solution of Systems of Polynomial Equations by Using Bernstein Expansion, in Alefeld, G., Rump, S., Rohn, J. and Yamamoto, T. (eds.), Symbolic Algebraic Methods and Verification Methods, Springer, Germany.
8. Gay, D.M. (1984), A trust region approach to linearly constrained optimization, in Griffiths, D.F. (ed.), Numerical Analysis, Lecture Notes in Mathematics 1066, Springer, Berlin.
9. Hansen, E. (1992), Global Optimization Using Interval Analysis. Marcel Dekker, New York.
10. Hoefkens, J. (2001), Rigorous Numerical Analysis with High-Order TaylorModels. PhD thesis, Michigan State University, East Lansing, Michigan, USA, also MSUCL-1217.
11. K. Ichida Y. Fujii 1979 An Interval Arithmetic Method for Global Optimization Computing 23 85 97
12. Kearfott, R.B. (1996), Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht.
13. Kearfott, R.B. and Arazyan, A. (2000), Taylor Series Models in Deterministic Global Optimization, in Proc. 3rd Int. Conf. and Workshop on Automatic Differentiation, June 2000.
14. Q. Lin J.G. Rokne 1996 Interval Approximation of Higher Order to the Ranges of Functions Computers Math. Appl. 31 7 101 109
15. Makino, K. and Berz, M. (1996), Remainder Differential Algebras and their Applications, in Berz, M., Bischof, C., Corliss, G. and Griewank, A. (eds.), Computational Differentiation: Techniques, Applications and Tools, pp. 63-75. SIAM.
16. Malan, S., Milanese, M., Taragna, M. and Garloff, J. (1992), B3 Algorithm for Robust Performance Analysis in Presence of Mixed Parametric and Dynamic Perturbations, in Proc. of the 31st IEEE CDC, pp. 128-133.
17. Moore, R.E. (1966), Interval Analysis, Prentice-Hall, Englewood Cliffs, N.J.
18. Moore, R.E. (1979), Methods and Applications of Interval Analysis, SIAM, Philadelphia.
19. R.E. Moore H. Ratschek 1988 Mathematical Programming 41 341 356
20. J.J. More B.S. Garbow K.E. Hillstrom 1981 Testing Unconstrained Optimization Software ACM Trans. Mathematical Software 7 1 17 41
21. Ratschek, H. Inclusion Functions and Global Optimization, Mathematical Programming, 33: 300-317.
22. Ratschek, H. and Rokne, J. (1984), Computer Methods for the Range of Functions, Ellis Horwood Limited, Chichester.
23. Ratschek, H. and Rokne, J. (1988), New Computer Methods for Global Optimization, Wiley, New York.
24. M. Zettler J. Garloff 1998 Robustness Analysis of Polynomials with Polynomial Parameter Dependency using Bernstein Expansion IEEE Trans. on Automat. Control 43 3 425 431