{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:48:25Z","timestamp":1777506505706,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540260035","type":"print"},{"value":"9783540320418","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11425076_6","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:27:56Z","timestamp":1279031276000},"page":"71-85","source":"Crossref","is-referenced-by-count":9,"title":["A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Garloff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew P.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Berkelaar M., LP_SOLVE: Linear Programming Code, ftp:\/\/ftp.ics.ele.tue.nl\/pub\/lpsolve\/"},{"key":"6_CR2","unstructured":"Berchtold, J.: The Bernstein Form in Set-Theoretical Geometric Modelling, PhD thesis, University of Bath (2000)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Van Hentenryck, P.: Safe and tight linear estimators for global optimization. Mathematical Programming (2004) (to appear)","DOI":"10.1007\/s10107-004-0533-8"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.6028\/jres.070B.005","volume":"70B","author":"G.T. Cargo","year":"1966","unstructured":"Cargo, G.T., Shisha, O.: The Bernstein form of a polynomial. J. Res. Nat. Bur. Standards\u00a070B, 79\u201381 (1966)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"6_CR5","series-title":"Series Nonconvex Optimization and its Applications","volume-title":"Deterministic Global Optimization: Theory, Methods, and Applications","author":"C.A. Floudas","year":"2000","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory, Methods, and Applications. Series Nonconvex Optimization and its Applications, vol.\u00a037. Kluwer Acad. Publ, Dordrecht (2000)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-16437-5_5","volume-title":"Interval Mathematics 1985","author":"J. Garloff","year":"1986","unstructured":"Garloff, J.: Convergent bounds for the range of multivariate polynomials. In: Nickel, K. (ed.) Interval Mathematics 1985. LNCS, vol.\u00a0212, pp. 37\u201356. Springer, Heidelberg (1986)"},{"key":"6_CR7","doi-asserted-by":"publisher","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. Computational and Applied Mathematics\u00a0157, 207\u2013225 (2003)","journal-title":"J. Computational and Applied Mathematics"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00607-003-1471-7","volume":"70","author":"J. Garloff","year":"2003","unstructured":"Garloff, J., Jansson, C., Smith, A.P.: Inclusion isotonicity of convexconcave extensions for polynomials based on Bernstein expansion. Computing\u00a070, 111\u2013119 (2003)","journal-title":"Computing"},{"key":"6_CR9","series-title":"Series Nonconvex Optimization with its Applications","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-1-4613-0251-3_8","volume-title":"Frontiers in Global Optimization","author":"J. Garloff","year":"2004","unstructured":"Garloff, J., Smith, A.P.: An improved method for the computation of affine lower bound functions for polynomials. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization. Series Nonconvex Optimization with its Applications, vol.\u00a074, pp. 135\u2013144. Kluwer Acad. Publ, Dordrecht (2004)"},{"key":"6_CR10","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"1992","unstructured":"Hansen, E.R.: Global Optimization Using Interval Analysis. Marcel Dekker, Inc., New York (1992)"},{"key":"6_CR11","unstructured":"Hongthong S., Kearfott, R.B., Rigorous linear overestimators and underestimators. submitted to Mathematical Programming B (2004)"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/S1052623402416839","volume":"14","author":"C. Jansson","year":"2004","unstructured":"Jansson, C.: Rigorous lower and upper bounds in linear programming. SIAM J. Optim.\u00a014(3), 914\u2013935 (2004)","journal-title":"SIAM J. Optim."},{"key":"6_CR13","series-title":"Series Nonconvex Optimization and its Applications","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. Series Nonconvex Optimization and its Applications, vol.\u00a013. Kluwer Acad. Publ, Dordrecht (1996)"},{"key":"6_CR14","unstructured":"Kearfott, R.B.: Empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization. Submitted to Optimization Methods and Software (2004)"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"C.A. Meyer","year":"2004","unstructured":"Meyer, C.A., Floudas, C.A.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. Journal of Global Optimization\u00a029(2), 125\u2013155 (2004)","journal-title":"Journal of Global Optimization"},{"key":"6_CR16","unstructured":"Michel, C., Lebbah, Y., Rueher, M.: Safe embeddings of the simplex algorithm in a CSP framework. In: Proc. 5th Int. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2003), pp. 210\u2013210. Universit\u00e9 de Montr\u00e9al (2003)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A. Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming. Math. Programming A\u00a099, 283\u2013296 (2004)","journal-title":"Math. Programming A"},{"key":"6_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04919-8","volume-title":"B\u00e9zier and B-Spline Techniques","author":"H. Prautzsch","year":"2002","unstructured":"Prautzsch, H., Boehm, W., Paluszny, M.: B\u00e9zier and B-Spline Techniques. Springer, Heidelberg (2002)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02253209","volume":"18","author":"J. Rokne","year":"1977","unstructured":"Rokne, J.: Bounds for an interval polynomial. Computing\u00a018, 225\u2013240 (1977)","journal-title":"Computing"},{"key":"6_CR20","volume-title":"New Computer Methods for Global Optimization","author":"H. Ratschek","year":"1988","unstructured":"Ratschek, H., Rokne, J.: New Computer Methods for Global Optimization. Ellis Horwood Ltd., Chichester (1988)"},{"key":"6_CR21","series-title":"Series Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Series Nonconvex Optimization and its Applications, vol.\u00a065. Kluwer Acad. Publ., Dordrecht (2002)"},{"key":"6_CR22","doi-asserted-by":"publisher","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. Automat. Contr.\u00a043, 425\u2013431 (1998)","journal-title":"IEEE Trans. Automat. Contr."}],"container-title":["Lecture Notes in Computer Science","Global Optimization and Constraint Satisfaction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11425076_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:12Z","timestamp":1605642912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11425076_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260035","9783540320418"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11425076_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}