{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:55:40Z","timestamp":1725738940347},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393198"},{"type":"electronic","value":"9783642393204"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39320-4_4","type":"book-chapter","created":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T11:22:52Z","timestamp":1372677772000},"page":"51-65","source":"Crossref","is-referenced-by-count":2,"title":["Certification of Bounds of Non-linear Functions: The Templates Method"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Allamigeon","sequence":"first","affiliation":[]},{"given":"St\u00e9phane","family":"Gaubert","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Magron","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00454-009-9148-4","volume":"44","author":"T.C. Hales","year":"2010","unstructured":"Hales, T.C., Harrison, J., McLaughlin, S., Nipkow, T., Obua, S., Zumkeller, R.: A revision of the proof of the kepler conjecture. Discrete & Computational Geometry\u00a044(1), 1\u201334 (2010)","journal-title":"Discrete & Computational Geometry"},{"key":"4_CR2","series-title":"Dagstuhl Seminar Proceedings","volume-title":"Mathematics, Algorithms, Proofs","author":"T.C. Hales","year":"2006","unstructured":"Hales, T.C.: Introduction to the flyspeck project. In: Coquand, T., Lombardi, H., Roy, M.-F. (eds.) Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, vol.\u00a005021, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2006)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.tcs.2008.09.025","volume":"409","author":"H. Peyrl","year":"2008","unstructured":"Peyrl, H., Parrilo, P.A.: Computing sum of squares decompositions with rational coefficients. Theor. Comput. Sci.\u00a0409(2), 269\u2013281 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR4","first-page":"1","volume":"47","author":"E.L. Kaltofen","year":"2012","unstructured":"Kaltofen, E.L., Li, B., Yang, Z., Zhi, L.: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. JSC\u00a047(1), 1\u201315 (2012); In memory of Wenda Wu (1929\u20132009)","journal-title":"JSC"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-22863-6_19","volume-title":"Interactive Theorem Proving","author":"D. Monniaux","year":"2011","unstructured":"Monniaux, D., Corbineau, P.: On the generation of Positivstellensatz witnesses in degenerate cases. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol.\u00a06898, pp. 249\u2013264. Springer, Heidelberg (2011)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-74464-1_4","volume-title":"Types for Proofs and Programs","author":"F. Besson","year":"2007","unstructured":"Besson, F.: Fast reflexive arithmetic tactics the linear case and beyond. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol.\u00a04502, pp. 48\u201362. Springer, Heidelberg (2007)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-74591-4_9","volume-title":"Theorem Proving in Higher Order Logics","author":"J. Harrison","year":"2007","unstructured":"Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 102\u2013118. Springer, Heidelberg (2007)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10817-009-9149-2","volume":"44","author":"B. Akbarpour","year":"2010","unstructured":"Akbarpour, B., Paulson, L.C.: Metitarski: An automatic theorem prover for real-valued special functions. J. Autom. Reason.\u00a044(3), 175\u2013205 (2010)","journal-title":"J. Autom. Reason."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Solovyev, A., Hales, T.C.: Formal verification of nonlinear inequalities with taylor interval approximations. CoRR, abs\/1301.1702 (2013)","DOI":"10.1007\/978-3-642-38088-4_26"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Gao, S., Avigad, J., Clarke, E.M.: Delta-complete decision procedures for satisfiability over the reals. CoRR, abs\/1204.3513 (2012)","DOI":"10.1007\/978-3-642-31365-3_23"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization\u00a011(3), 796\u2013817 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"4_CR12","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1090\/dimacs\/060\/08","volume-title":"Minimizing polynomial functions","author":"P.A. Parrilo","year":"2003","unstructured":"Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol.\u00a060, pp. 83\u201399. Amer. Math. Soc., Providence (2003)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H. Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM Journal on Optimization\u00a017, 218\u2013242 (2006)","journal-title":"SIAM Journal on Optimization"},{"key":"4_CR14","unstructured":"Zumkeller, R.: Rigorous Global Optimization. PhD thesis, \u00c8cole Polytechnique (2008)"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11155-006-2967-6","volume":"12","author":"E.R. Hansen","year":"2006","unstructured":"Hansen, E.R.: Sharpening interval computations. Reliable Computing\u00a012(1), 21\u201334 (2006)","journal-title":"Reliable Computing"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C. Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. part i: motivation, convergence and numerical results. Math. Program.\u00a0127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"M. Montaz Ali","year":"2005","unstructured":"Montaz Ali, M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. of Global Optimization\u00a031(4), 635\u2013672 (2005)","journal-title":"J. of Global Optimization"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 25\u201341. Springer, Heidelberg (2005)"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(1:1)2012","volume":"8","author":"A. Adje","year":"2012","unstructured":"Adje, A., Gaubert, S., Goubault, E.: Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. Logical Methods in Computer Science\u00a08(1), 1\u201332 (2012)","journal-title":"Logical Methods in Computer Science"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0363012998332433","volume":"38","author":"W.H. Fleming","year":"2000","unstructured":"Fleming, W.H., McEneaney, W.M.: A max-plus-based algorithm for a Hamilton-Jacobi-Bellman equation of nonlinear filtering. SIAM J. Control Optim.\u00a038(3), 683\u2013710 (2000)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1137\/060655286","volume":"47","author":"M. Akian","year":"2008","unstructured":"Akian, M., Gaubert, S., Lakhoua, A.: The max-plus finite element method for solving deterministic optimal control problems: basic properties and convergence analysis. SIAM J. Control Optim.\u00a047(2), 817\u2013848 (2008)","journal-title":"SIAM J. Control Optim."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"McEneaney, W.M., Deshpande, A., Gaubert, S.: Curse-of-complexity attenuation in the curse-of-dimensionality-free method for HJB PDEs. In: Proc. of the 2008 American Control Conference, Seattle, Washington, USA, pp. 4684\u20134690 (June 2008)","DOI":"10.1109\/ACC.2008.4587234"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1137\/040610830","volume":"46","author":"W.M. McEneaney","year":"2007","unstructured":"McEneaney, W.M.: A curse-of-dimensionality-free numerical method for solution of certain HJB PDEs. SIAM J. Control Optim.\u00a046(4), 1239\u20131276 (2007)","journal-title":"SIAM J. Control Optim."},{"key":"4_CR24","unstructured":"Gaubert, S., McEneaney, W.M., Qu, Z.: Curse of dimensionality reduction in max-plus based approximation methods: Theoretical estimates and improved pruning algorithms. In: CDC-ECC [36], pp. 1054\u20131061"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Allamigeon, X., Gaubert, S., Magron, V., Werner, B.: Certification of inequalities involving transcendental functions: combining sdp and max-plus approximation. To appear in the Proceedings of the European Control Conference, ECC 2013, Zurich (2013)","DOI":"10.23919\/ECC.2013.6669514"},{"issue":"6","key":"4_CR26","doi-asserted-by":"publisher","first-page":"3364","DOI":"10.1137\/090775221","volume":"20","author":"J.B. Lasserre","year":"2010","unstructured":"Lasserre, J.B., Putinar, M.: Positivity and optimization for semi-algebraic functions. SIAM Journal on Optimization\u00a020(6), 3364\u20133383 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"4_CR27","unstructured":"Yamashita, M., Fujisawa, K., Nakata, K., Nakata, M., Fukuda, M., Kobayashi, K., Goto, K.: A high-performance software package for semidefinite programs: Sdpa7. Technical report, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan (2010)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Akian, M., Gaubert, S., Kolokoltsov, V.N.: Set coverings and invertibility of functional galois connections. In: Litvinov, G.L., Maslov, V.P. (eds.) Idempotent Mathematics and Mathematical Physics, Contemporary Mathematics, pp. 19\u201351. American Mathematical Society (2005)","DOI":"10.1090\/conm\/377\/06983"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10957-008-9423-1","volume":"139","author":"G. Calafiore","year":"2008","unstructured":"Calafiore, G., Dabbene, F.: Reduced vertex set result for interval semidefinite optimization problems. Journal of Optimization Theory and Applications\u00a0139, 17\u201333 (2008), doi:10.1007\/s10957-008-9423-1","journal-title":"Journal of Optimization Theory and Applications"},{"key":"4_CR30","unstructured":"Riener, C., Theobald, T., Andr\u00e9n, L.J., Lasserre, J.B.: Exploiting symmetries in sdp-relaxations for polynomial optimization. CoRR, abs\/1103.0486 (2011)"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: Algorithm 883: Sparsepop\u2014a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw.\u00a035(2) (2008)","DOI":"10.1145\/1377612.1377619"},{"key":"4_CR32","unstructured":"Montanher, T.M.: Intsolver: An interval based toolbox for global optimization, Version 1.0 (2009), \n                    \n                      www.mathworks.com"},{"issue":"2-3","key":"4_CR33","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0096-3003(83)90001-2","volume":"12","author":"E.R. Hansen","year":"1983","unstructured":"Hansen, E.R., Greenberg, R.I.: An interval newton method. Applied Mathematics and Computation\u00a012(2-3), 89\u201398 (1983)","journal-title":"Applied Mathematics and Computation"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1837934.1837966","volume-title":"Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010","author":"N. Brisebarre","year":"2010","unstructured":"Brisebarre, N., Jolde\u015f, M.: Chebyshev interpolation polynomial-based tools for rigorous computing. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, pp. 147\u2013154. ACM, New York (2010)"},{"key":"4_CR35","unstructured":"Lasserre, J.B., Thanh, T.P.: Convex underestimators of polynomials. In: CDC-ECE [36], pp. 7194\u20137199"},{"key":"4_CR36","unstructured":"Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011, Orlando, FL, USA, December 12-15. IEEE (2010)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39320-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T06:15:38Z","timestamp":1557900938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39320-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393198","9783642393204"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39320-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}