{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:25:41Z","timestamp":1787502341821,"version":"build-2736575974"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T00:00:00Z","timestamp":1228867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10898-008-9382-y","type":"journal-article","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T06:29:33Z","timestamp":1228804173000},"page":"403-426","source":"Crossref","is-referenced-by-count":21,"title":["An efficient algorithm for range computation of polynomials using the Bernstein form"],"prefix":"10.1007","volume":"45","author":[{"given":"Shashwati","family":"Ray","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. S. V.","family":"Nataraj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,12,10]]},"reference":[{"key":"9382_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/S0010-4485(00)00056-7","volume":"32","author":"J. Berchtold","year":"2000","unstructured":"Berchtold J., Bowyer A.: Robust arithmetic for multivariateBernstein-form polynomials. Comput. Aided Geom. Des. 32, 681\u2013689 (2000)","journal-title":"Comput. Aided Geom. Des."},{"key":"9382_CR2","unstructured":"Berchtold, J., Voiculescu, I., Bowyer, A.: Multivariate Bernstein form polynomials. Technical Report 31\/98, School of Mechanical Engineering (1998)"},{"key":"9382_CR3","doi-asserted-by":"crossref","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Using algebraic geometry. In: Graduate Texts in Mathematics, vol. 185. Springer-Verlag, New York (1998)","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"9382_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0167-8396(87)90012-4","volume":"4","author":"R.T. Farouki","year":"1987","unstructured":"Farouki R.T., Rajan V.T.: On the numerical condition of polynomials in Bernstein form. Comput. Aided Geom. Des. 4, 191\u2013216 (1987)","journal-title":"Comput. Aided Geom. Des."},{"key":"9382_CR5","first-page":"154","volume":"2","author":"J. Garloff","year":"1993","unstructured":"Garloff J.: The Bernstein algorithm. Interval Comput. 2, 154\u2013168 (1993)","journal-title":"Interval Comput."},{"key":"9382_CR6","first-page":"80","volume":"25\u201327","author":"J. Garloff","year":"2003","unstructured":"Garloff J.: The Bernstein expansion and its applications. J. Am. Romanian Acad. 25\u201327, 80\u201385 (2003)","journal-title":"J. Am. Romanian Acad."},{"key":"9382_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-7091-6280-4_9","volume-title":"Symbolic Algebraic Methods and Verification Methods","author":"J. Garloff","year":"2001","unstructured":"Garloff J., Smith A.P.: Solution of systems of polynomial equations by using Bernstein expansion. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds) Symbolic Algebraic Methods and Verification Methods, pp. 87\u201397. Springer, New York (2001)"},{"key":"9382_CR8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/11425076_6","volume-title":"Global Optimization and Constraint Satisfaction: 2nd International Workshop, COCOS 2003, Lecture Notes in Computer Science","author":"J. Garloff","year":"2005","unstructured":"Garloff J., Smith A.P.: A comparison of methods for the computation of affine lower bound functions for polynomials. In: Jermann, C., Neumaier, A., Sam, D. (eds) Global Optimization and Constraint Satisfaction: 2nd International Workshop, COCOS 2003, Lecture Notes in Computer Science, pp. 71\u201385. Springer, Berlin (2005)"},{"issue":"1","key":"9382_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0377-0427(03)00422-9","volume":"157","author":"J. Garloff","year":"2003","unstructured":"Garloff J., Jansson C., Smith A.P.: Lower bound functions for polynomials. J. Comput. Appl. Math. 157(1), 207\u2013225 (2003)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"9382_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00939433","volume":"54","author":"R.P. Ge","year":"1987","unstructured":"Ge R.P., Qin Y.F.: A class of filled functions for finding global minimizers of a function of several variables. J. Optim. Theory Appl. 54(2), 241\u2013252 (1987)","journal-title":"J. Optim. Theory Appl."},{"key":"9382_CR11","first-page":"131","volume":"35","author":"R. Ge","year":"1990","unstructured":"Ge R., Qin Y.: The globally convexized filled functions for global optimization. Appl. Math. Comput. 35, 131\u2013158 (1990)","journal-title":"Appl. Math. Comput."},{"key":"9382_CR12","volume-title":"Numerical Toolbox for Verified Computing I","author":"R. Hammer","year":"1993","unstructured":"Hammer R., Hocks M., Kulisch U., Ratz D.: Numerical Toolbox for Verified Computing I. Springer Verlag, Heidelberg, New York (1993)"},{"issue":"10\/11","key":"9382_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0898-1221(93)90288-7","volume":"25","author":"E.R. Hansen","year":"1993","unstructured":"Hansen E.R.: Nonlinear equations and optimization. Comput. Math. Appl. 25(10\/11), 125\u2013145 (1993)","journal-title":"Comput. Math. Appl."},{"key":"9382_CR14","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"2004","unstructured":"Hansen E.R., Walster G.W.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (2004)"},{"key":"9382_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D. Henrion","year":"2003","unstructured":"Henrion D., Lasserre J.B.: Gloptipoly: global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Soft. 29, 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Soft."},{"key":"9382_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Handbook of Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst R., Pardalos P.M.: Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)"},{"issue":"2","key":"9382_CR17","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/04060562X","volume":"16","author":"D. Jibetean","year":"2005","unstructured":"Jibetean D., Laurent M.: Semidefinite approximations for global unconstrained polynomial optimization. SIAM J. Optim. 16(2), 490\u2013514 (2005)","journal-title":"SIAM J. Optim."},{"key":"9382_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems","author":"R.B. Kearfott","year":"1996","unstructured":"Kearfott R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"9382_CR19","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/S0377-2217(96)00310-4","volume":"107","author":"H.L. Li","year":"1998","unstructured":"Li H.L., Chang C.T.: An approximate approach of global optimization for polynomial programming problems. Eur. J. Oper. Res. 107, 625\u2013632 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9382_CR20","volume-title":"Bernstein Polynomials","author":"C.G. Lorenz","year":"1953","unstructured":"Lorenz C.G.: Bernstein Polynomials. University of Toronto Press, Toronto (1953)"},{"key":"9382_CR21","doi-asserted-by":"crossref","unstructured":"Malan, S., Milanese, M., Taragna, M., Garloff, J.: B3 algorithm for robust performance analysis in presence of mixed parametric and dynamic perturbations. In: Proceedings of the 31st Conference on Decision and Control, pp. 128\u2013133. Tucson, Arizona (1992)","DOI":"10.1109\/CDC.1992.371776"},{"key":"9382_CR22","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and Applications of Interval Analysis","author":"R.E. Moore","year":"1979","unstructured":"Moore R.E.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)"},{"issue":"1","key":"9382_CR23","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10898-004-5906-2","volume":"32","author":"P.S.V. Nataraj","year":"2005","unstructured":"Nataraj P.S.V., Kotecha K.: An improved interval global optimization algorithm using higher order inclusion function forms. J. Global Optim. 32(1), 35\u201363 (2005)","journal-title":"J. Global Optim."},{"key":"9382_CR24","doi-asserted-by":"crossref","unstructured":"Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. In: Basu, S., Gonzales-Vega, L. (eds.) Algorithmic and Quantitative Real Algebraic Geometry, vol. 60 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (2003)","DOI":"10.1090\/dimacs\/060\/08"},{"key":"9382_CR25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/978-1-4757-5362-2_15","volume-title":"Handbook of Global Optimization, vol. 2","author":"J.D . Pinter","year":"2002","unstructured":"Pinter J.D .: Global optimization: software, test problems, and applications. In: Pardalos, P.M., Romeijn, H.E. (eds) Handbook of Global Optimization, vol. 2, pp. 515\u2013569. Kluwer Academic Publishers, London (2002)"},{"key":"9382_CR26","volume-title":"Computer Methods for the Range of Functions","author":"H. Ratschek","year":"1984","unstructured":"Ratschek H., Rokne J.: Computer Methods for the Range of Functions. Ellis Horwood, New York (Chichester) (1984)"},{"key":"9382_CR27","unstructured":"Ray, S.: A new appraoch to range computation of polynomials using the Bernstein form. PhD Thesis, System and Control Engineering, Indian Institute of Technology, Bombay, India (2007)"},{"key":"9382_CR28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0377-2217(02)00871-8","volume":"155","author":"S. Salhi","year":"2004","unstructured":"Salhi S., Queen N.M.: A hybrid algorithm for detecting global and local minima when optimizing functions with many minima. Eur. J. Oper. Res. 155, 51\u201367 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9382_CR29","doi-asserted-by":"crossref","unstructured":"Smith, A.P.: Fast construction of constant bound functions for sparse polynomials. J. Global Optim. July (2007, published online)","DOI":"10.1007\/s10898-007-9195-4"},{"key":"9382_CR30","unstructured":"Sun Microsystems, Palo Alto, CA, USA. Forte FORTRAN 95 User Manual (2001)"},{"key":"9382_CR31","unstructured":"Verschelde, J.: The PHC pack, the database of polynomial systems. Technical Report, University of Illinois, Mathematics Department, Chicago, USA (2001)"},{"key":"9382_CR32","first-page":"186","volume-title":"Scientifc Computing and Validated Numerics","author":"M.N. Vrahatis","year":"1996","unstructured":"Vrahatis M.N.: A generalized bisection method for large and imprecise problems. In: Alefeld, G., Frommer, A., Lang, B. (eds) Scientifc Computing and Validated Numerics, pp. 186\u2013192. Akademie Verlag, Berlin (1996)"},{"key":"9382_CR33","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-1-4757-2600-8_3","volume-title":"Developments in Global Optimization","author":"M.N. Vrahatis","year":"1997","unstructured":"Vrahatis M.N., Sotiropoulos D.G., Triantafyllou E.C.: Global optimization for imprecise problems. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M. (eds) Developments in Global Optimization, pp. 37\u201354. Kluwer, The Netherlands (1997)"},{"issue":"2\u20133","key":"9382_CR34","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0096-3003(96)90061-2","volume":"75","author":"M.A. Wolfe","year":"1996","unstructured":"Wolfe M.A.: Interval methods for global optimization. Appl. Math. Comput. 75(2\u20133), 179\u2013206 (1996)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9382_CR35","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/9.661615","volume":"43","author":"M. Zettler","year":"1998","unstructured":"Zettler M., Garloff J.: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Trans. Automatic Control 43(3), 425\u2013431 (1998)","journal-title":"IEEE Trans. Automatic Control"},{"key":"9382_CR36","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/B:JOGO.0000006653.60256.f6","volume":"28","author":"L.S. Zhang","year":"2004","unstructured":"Zhang L.S., Ng C.K., Li D., Tian W.W.: A new filled function method for global optimization. J. Global Optim. 28, 17\u201343 (2004)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9382-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-008-9382-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9382-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T21:49:15Z","timestamp":1738792155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-008-9382-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,10]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9382"],"URL":"https:\/\/doi.org\/10.1007\/s10898-008-9382-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,10]]}}}