{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:13:38Z","timestamp":1764645218983},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_49","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T22:17:11Z","timestamp":1406845031000},"page":"315-320","source":"Crossref","is-referenced-by-count":6,"title":["NLCertify: A Tool for Formal Nonlinear Optimization"],"prefix":"10.1007","author":[{"given":"Victor","family":"Magron","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"49_CR1","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":"49_CR2","unstructured":"Allamigeon, X., Gaubert, S., Magron, V., Werner, B.: Certification of real inequalities \u2013 templates and sums of squares (submitted for publication, March 2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1403.5899"},{"key":"49_CR3","unstructured":"Allamigeon, X., Gaubert, S., Magron, V., Werner, B.: Formal proofs for nonlinear optimization (submitted for publication, April 2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1404.7282"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-25379-9_12","volume-title":"Certified Programs and Proofs","author":"M. Armand","year":"2011","unstructured":"Armand, M., Faure, G., Gr\u00e9goire, B., Keller, C., Th\u00e9ry, L., Werner, B.: A Modular Integration of SAT\/SMT Solvers to Coq through Proof Witnesses. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol.\u00a07086, pp. 135\u2013150. Springer, Heidelberg (2011)"},{"key":"49_CR5","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":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-15582-6_5","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S. Chevillard","year":"2010","unstructured":"Chevillard, S., Jolde\u015f, M., Lauter, C.: Sollya: An environment for the development of numerical codes. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol.\u00a06327, pp. 28\u201331. Springer, Heidelberg (2010)"},{"key":"49_CR7","unstructured":"The Coq Proof Assistant, \n                    \n                      http:\/\/coq.inria.fr\/"},{"issue":"3","key":"49_CR8","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2005.162.1065","volume":"162","author":"T.C. Hales","year":"2005","unstructured":"Hales, T.C.: A proof of the Kepler conjecture. Ann. of Math (2)\u00a0162(3), 1065\u20131185 (2005)","journal-title":"Ann. of Math. (2)"},{"issue":"4-5","key":"49_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D. Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.-B., L\u00f6fberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optimization Methods and Software\u00a024(4-5), 761\u2013779 (2009)","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"49_CR10","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"},{"issue":"6","key":"49_CR11","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":"49_CR12","unstructured":"L\u00f6fberg, J.: Yalmip: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"49_CR13","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)"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10817-012-9256-3","volume":"51","author":"C. Muoz","year":"2013","unstructured":"Muoz, C., Narkawicz, A.: Formalization of bernstein polynomials and applications to global optimization. Journal of Automated Reasoning\u00a051(2), 151\u2013196 (2013)","journal-title":"Journal of Automated Reasoning"},{"key":"49_CR15","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":"49_CR16","doi-asserted-by":"crossref","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: Sparsepop\u2014a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw.\u00a035(2) (2008)","DOI":"10.1145\/1377612.1377619"},{"key":"49_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:31:05Z","timestamp":1558963865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}