{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:48:25Z","timestamp":1775868505662,"version":"3.50.1"},"reference-count":96,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0953941"],"award-info":[{"award-number":["CNS-0953941"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527075"],"award-info":[{"award-number":["CCF-1527075"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-12-INSE-0007 Cafein"],"award-info":[{"award-number":["ANR-12-INSE-0007 Cafein"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10703-017-0302-y","type":"journal-article","created":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T11:49:41Z","timestamp":1507981781000},"page":"286-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Validating numerical semidefinite programming solvers for polynomial invariants"],"prefix":"10.1007","volume":"53","author":[{"given":"Pierre","family":"Roux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuen-Lam","family":"Voronin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Sankaranarayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"302_CR1","doi-asserted-by":"crossref","unstructured":"Adj\u00e9 A, Garoche P-L, Magron, V (2015) Property-based polynomial invariant generation using sums-of-squares optimization. In: SAS, pp 235\u2013251","DOI":"10.1007\/978-3-662-48288-9_14"},{"key":"302_CR2","doi-asserted-by":"crossref","unstructured":"Adj\u00e9 A, Gaubert S, Goubault \u00c9 (2010) Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. In: ESOP","DOI":"10.1007\/978-3-642-11957-6_3"},{"key":"302_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadi AA, Majumdar A (2014) DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization. In: Annual conference on information sciences and systems (CISS)","DOI":"10.1109\/CISS.2014.6814141"},{"issue":"4","key":"302_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1089\/cmb.2012.0089","volume":"20","author":"B Alipanahi","year":"2013","unstructured":"Alipanahi B, Krislock N, Ghodsi A, Wolkowicz H, Donaldson L, Li M (2013) Determining protein structures from NOESY distance constraints by semidefinite programming. J Comput Biol 20(4):296\u2013310","journal-title":"J Comput Biol"},{"issue":"3","key":"302_CR5","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh F, Haeberly J-PA, Overton ML (1998) Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J Optim 8(3):746\u2013768 (electronic)","journal-title":"SIAM J Optim"},{"key":"302_CR6","doi-asserted-by":"crossref","unstructured":"Allamigeon X, Gaubert S, Goubault E, Putot S, Stott N (2015) A scalable algebraic method to infer quadratic invariants of switched systems. In: EMSOFT","DOI":"10.1109\/EMSOFT.2015.7318262"},{"key":"302_CR7","doi-asserted-by":"crossref","unstructured":"Anjos MF, Lasserre JB (2012) Introduction to semidefinite, conic and polynomial optimization. In: Handbook on semidefinite, conic and polynomial optimization. Springer","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"302_CR8","doi-asserted-by":"crossref","unstructured":"Bagnara R, Rodr\u00edguez-Carbonell E, Zaffanella E (2005) Generation of basic semi-algebraic invariants using convex polyhedra. In: SAS","DOI":"10.1007\/11547662_4"},{"key":"302_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in real algebraic geometry","author":"S Basu","year":"2006","unstructured":"Basu S, Pollock R, Roy M-F (2006) Algorithms in real algebraic geometry. Springer, Berlin"},{"key":"302_CR10","series-title":"Princeton series in applied mathematics","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, Ghaoui LE (2009) Robust optimization. Princeton series in applied mathematics. Princeton University Press, Princeton"},{"key":"302_CR11","doi-asserted-by":"crossref","unstructured":"Ben Sassi MA, Sankaranarayanan S, Chen X, Abraham E (2015) Linear relaxations of polynomial positivity for polynomial lyapunov function synthesis. IMA J Math Control Inf","DOI":"10.1093\/imamci\/dnv003"},{"key":"302_CR12","unstructured":"Bernstein SN (1912) D\u00e9monstration du th\u00e9or\u00e9me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Communcations de la Soci\u00e9t\u00e9 Math\u00e9matique de Kharkov 2"},{"key":"302_CR13","doi-asserted-by":"crossref","unstructured":"Borchers B (1999) CSDP, a C library for semidefinite programming. Optim Methods Softw","DOI":"10.1080\/10556789908805765"},{"issue":"4","key":"302_CR14","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1017\/S1446788700017882","volume":"30","author":"JM Borwein","year":"1980","unstructured":"Borwein JM (1980) Characterization of optimality for the abstract convex program with finite-dimensional range. J. Aust. Math. Soc. Ser. A 30(4):390\u2013411 81","journal-title":"J. Aust. Math. Soc. Ser. A"},{"key":"302_CR15","unstructured":"Borwein JM, Wolkowicz H (1980\/81) Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. Ser. A,"},{"issue":"2","key":"302_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"Borwein JM, Wolkowicz H (1981) Regularizing the abstract convex program. J Math Anal Appl 83(2):495\u2013530","journal-title":"J Math Anal Appl"},{"key":"302_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge university press, Cambridge"},{"issue":"4","key":"302_CR18","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1287\/ijoc.2014.0596","volume":"26","author":"F Burkowski","year":"2014","unstructured":"Burkowski F, Cheung Y-L, Wolkowicz H (2014) Efficient use of semidefinite programming for selection of rotamers in protein conformations. Inform J Comput 26(4):748\u2013766","journal-title":"Inform J Comput"},{"key":"302_CR19","doi-asserted-by":"crossref","unstructured":"Chakarov A, Voronin Y-L, Sankaranarayanan S (2016) Deductive proofs of almost sure persistence and recurrence properties. In: TACAS","DOI":"10.1007\/978-3-662-49674-9_15"},{"key":"302_CR20","volume-title":"Computational and analytical mathematics, in honor of Jonathan Borwein\u2019s 60th birthday, volume 50 of springer proceedings in mathematics & statistics","author":"Y-L Cheung","year":"2013","unstructured":"Cheung Y-L, Schurr S, Wolkowicz H (2013) Preprocessing and regularization for degenerate semidefinite programs. In: Bailey DH, Bauschke HH, Borwein P, Garvan F, Thera M, Vanderwerff J, Wolkowicz H (eds) Computational and analytical mathematics, in honor of Jonathan Borwein\u2019s 60th birthday, volume 50 of springer proceedings in mathematics & statistics. Springer, Berlin"},{"key":"302_CR21","unstructured":"Cheung Y-L (2013) Preprocessing and reduction for semidefinite programming via facial reduction: theory and practice. PhD thesis, University of Waterloo"},{"key":"302_CR22","doi-asserted-by":"crossref","unstructured":"Collins GE (1975) Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Automata theory and formal languages","DOI":"10.1007\/3-540-07407-4_17"},{"key":"302_CR23","doi-asserted-by":"crossref","unstructured":"Collins GE, Hong H (1991) Partial cylindrical algebraic decomposition for quantifier elimination. J Symb Comput","DOI":"10.1016\/S0747-7171(08)80152-6"},{"key":"302_CR24","doi-asserted-by":"crossref","unstructured":"Cousot P (2005) Proving program invariance and termination by parametric abstraction. lagrangian relaxation and semidefinite programming. In: VMCAI","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"302_CR25","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL","DOI":"10.1145\/512950.512973"},{"key":"302_CR26","doi-asserted-by":"crossref","unstructured":"Dang T, Gawlitza TM (2011) Template-based unbounded time verification of affine hybrid automata. In: APLAS","DOI":"10.1007\/978-3-642-25318-8_6"},{"key":"302_CR27","unstructured":"Demmel J (1989) On floating point errors in Cholesky. LAPACK Working Note 14 CS-89-87. Department of Computer Science, University of Tennessee, Knoxville, TN, USA"},{"key":"302_CR28","doi-asserted-by":"crossref","unstructured":"Dolzmann A, Sturm T (1997) REDLOG: computer algebra meets computer logic. ACM SIGSAM Bull","DOI":"10.1145\/261320.261324"},{"key":"302_CR29","unstructured":"D\u00fcr M, Jargalsaikhan B, Still G (2012) The Slater condition is generic in linear conic programming"},{"issue":"1","key":"302_CR30","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L El Ghaoui","year":"1998","unstructured":"El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9(1):33\u201352","journal-title":"SIAM J Optim"},{"key":"302_CR31","doi-asserted-by":"crossref","unstructured":"Farouki RT (2012) The Bernstein polynomial basis: a centennial retrospective. Comput Aided Geomet Des","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"302_CR32","unstructured":"F\u00e9ron \u00c9 (2010) From control systems to control software. Control Systems, IEEE"},{"key":"302_CR33","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nzle M, Herde C, Teige T, Ratschan S, Schubert T (2007) Efficient solving of large non-linear arithmetic constraint systems with complex Boolean structure. J Satisf Boolean Model Comput Special Issue on SAT\/CP Integr","DOI":"10.3233\/SAT190012"},{"key":"302_CR34","doi-asserted-by":"crossref","unstructured":"Gao S, Kong S, Clarke EM (2013) Dreal: an SMT solver for nonlinear theories over the reals. In: International conference on automated deduction (CADE), pp 208\u2013214","DOI":"10.1007\/978-3-642-38574-2_14"},{"key":"302_CR35","doi-asserted-by":"crossref","unstructured":"Gaubert S, Goubault E, Taly A, Zennou S (2007) Static analysis by policy iteration on relational domains. In: ESOP","DOI":"10.1007\/978-3-540-71316-6_17"},{"key":"302_CR36","doi-asserted-by":"crossref","unstructured":"Gawlitza T, Seidl H (2007) Precise fixpoint computation through strategy iteration. In: ESOP","DOI":"10.1007\/978-3-540-71316-6_21"},{"key":"302_CR37","doi-asserted-by":"crossref","unstructured":"Gawlitza TM, Monniaux D (2011) Improving strategies via SMT solving. In: ESOP","DOI":"10.1007\/978-3-642-19718-5_13"},{"key":"302_CR38","doi-asserted-by":"crossref","unstructured":"Gawlitza TM, Seidl H (2010) Computing relaxed abstract semantics w.r.t. quadratic zones precisely. In: SAS","DOI":"10.1007\/978-3-642-15769-1_17"},{"issue":"2","key":"302_CR39","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1013716917710","volume":"21","author":"G Gruber","year":"2002","unstructured":"Gruber G, Rendl F (2002) Computational experience with ill-posed problems in semidefinite programming. Comput Optim Appl 21(2):201\u2013212","journal-title":"Comput Optim Appl"},{"key":"302_CR40","doi-asserted-by":"crossref","unstructured":"Handelman D (1988) Representing polynomials by positive linear functions on compact convex polyhedra. Pacific J Math","DOI":"10.2140\/pjm.1988.132.35"},{"key":"302_CR41","unstructured":"Harrison J (2007) Verifying nonlinear real formulas via sums of squares. In: TPHOL"},{"key":"302_CR42","unstructured":"H\u00e4rter V, Jansson C, Lange M (2016) VSDP: verified semidefinite programming. http:\/\/www.ti3.tuhh.de\/jansson\/vsdp\/ . Accessed on 28 March"},{"key":"302_CR43","unstructured":"Helmberg C (2012) Semidefinite programming. https:\/\/www-user.tu-chemnitz.de\/~helmberg\/semidef.html . Last updated:"},{"key":"302_CR44","unstructured":"Henrion D, Naldi S, Din MS\u00a0El (2015) Exact algorithms for linear matrix inequalities. arXiv preprint arXiv:1508.03715"},{"key":"302_CR45","unstructured":"IEEE Computer Society. IEEE standard for floating-point arithmetic. IEEE Standard 754-2008, 2008"},{"key":"302_CR46","doi-asserted-by":"crossref","unstructured":"Jansson C, Chaykin D, Keil C (2007) Rigorous error bounds for the optimal value in semidefinite programming. SIAM J Numer Anal","DOI":"10.1137\/050622870"},{"key":"302_CR47","doi-asserted-by":"crossref","unstructured":"Kaltofen E, Li B, Yang Z, Zhi L (2012) Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J Symb Comput","DOI":"10.1016\/j.jsc.2011.08.002"},{"issue":"5","key":"302_CR48","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1137\/090759392","volume":"20","author":"N Krislock","year":"2010","unstructured":"Krislock N, Wolkowicz H (2010) Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J Optim 20(5):2679\u20132708","journal-title":"SIAM J Optim"},{"key":"302_CR49","doi-asserted-by":"crossref","unstructured":"Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J Optim","DOI":"10.1137\/S1052623400366802"},{"key":"302_CR50","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg J (2009) Pre- and post-processing sum-of-squares programs in practice. In: IEEE transactions on automatic control","DOI":"10.1109\/TAC.2009.2017144"},{"key":"302_CR51","doi-asserted-by":"crossref","unstructured":"Mar\u00e9chal A, Fouilh\u00e9 A, King T, Monniaux D, \u00ebl P\u00e9rin M (2016) Polyhedral approximation of multivariate polynomials using Handelman\u2019s theorem. In: VMCAI","DOI":"10.1007\/978-3-662-49122-5_8"},{"key":"302_CR52","doi-asserted-by":"crossref","unstructured":"Martin-Dorel \u00c9, Roux P (2017) A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations. In: Yves B, Viktor V (eds) Proceedings of the 6th ACM SIGPLAN conference on certified programs and proofs, CPP 2017, Paris, France, January 16\u201317, 2017, pp 90\u201399. ACM,","DOI":"10.1145\/3018610.3018622"},{"key":"302_CR53","unstructured":"Mittelmann HD (2016) Decision tree for optimization software: semidefinite programming. http:\/\/plato.asu.edu\/sub\/nlores.html#semidef . Accessed on 28 March"},{"key":"302_CR54","doi-asserted-by":"crossref","unstructured":"Monniaux D, Corbineau P (2011) On the generation of positivstellensatz witnesses in degenerate cases. In: ITP","DOI":"10.1007\/978-3-642-22863-6_19"},{"key":"302_CR55","unstructured":"MOSEK ApS (2015) The MOSEK C optimizer API manual Version 7.1 (Revision 40)"},{"key":"302_CR56","doi-asserted-by":"crossref","unstructured":"Nakata M (2010) A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver: SDPA-GMP, -QD and -DD. In: Computer-aided control system design","DOI":"10.1109\/CACSD.2010.5612693"},{"key":"302_CR57","doi-asserted-by":"crossref","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming. Soc Ind Appl Math","DOI":"10.1137\/1.9781611970791"},{"issue":"2","key":"302_CR58","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10107-008-0253-6","volume":"122","author":"J Nie","year":"2008","unstructured":"Nie J, Ranestad K, Sturmfels B (2008) The algebraic degree of semidefinite programming. Math Program 122(2):379\u2013405","journal-title":"Math Program"},{"key":"302_CR59","unstructured":"Nuzzo P, Puggelli A, Seshia SA, Sangiovanni-Vincentelli AL (2010) Calcs: SMT solving for non-linear convex constraints. In: Bloem R, Sharygina N (eds) Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design. Switzerland, FMCAD 2010, Lugano, October 20\u201323, pp 71\u201379. IEEE"},{"key":"302_CR60","doi-asserted-by":"crossref","unstructured":"Oulamara M, Venet AJ (2015) Abstract interpretation with higher-dimensional ellipsoids and conic extrapolation. In: CAV","DOI":"10.1007\/978-3-319-21690-4_24"},{"key":"302_CR61","unstructured":"Parrilo P (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology"},{"key":"302_CR62","doi-asserted-by":"crossref","unstructured":"Parrilo PA (2003) Semidefinite programming relaxations for semialgebraic problems. Math Program","DOI":"10.1007\/s10107-003-0387-5"},{"key":"302_CR63","first-page":"613","volume-title":"Computational and analytical mathematics, in honor of Jonathan Borwein\u2019s 60th birthday, volume 50 springer proceedings in mathematics & statistics","author":"G Pataki","year":"2013","unstructured":"Pataki G (2013) Strong duality in conic linear programming: facial reduction and extended duals. In: Bailey DH, Bauschke HH, Borwein P, Garvan F, Thera M, Vanderwerff J, Wolkowicz H (eds) Computational and analytical mathematics, in honor of Jonathan Borwein\u2019s 60th birthday, volume 50 springer proceedings in mathematics & statistics. Springer, Berlin, pp 613\u2013634"},{"key":"302_CR64","unstructured":"Permenter F, Parrilo P (2014) Partial facial reduction: simplified, equivalent sdps via approximations of the psd cone. arXiv preprint arXiv:1408.4685"},{"key":"302_CR65","unstructured":"Permenter F, Parrilo PA (2015) Tools for SDP facial reduction. https:\/\/github.com\/frankpermenter\/frlib . Accessed on 10 Apr 2015"},{"key":"302_CR66","doi-asserted-by":"crossref","unstructured":"Peyrl H, Parrilo PA (2008) Computing sum of squares decompositions with rational coefficients. Theor Comput Sci","DOI":"10.1016\/j.tcs.2008.09.025"},{"key":"302_CR67","doi-asserted-by":"crossref","unstructured":"Platzer A, Quesel J-D, R\u00fcmmer P (2009) Real world verification. In: CADE","DOI":"10.1007\/978-3-642-02959-2_35"},{"key":"302_CR68","doi-asserted-by":"crossref","unstructured":"Prajna S, Jadbabaie A (2004) Safety verification using barrier certificates. In: HSCC","DOI":"10.1007\/978-3-540-24743-2_32"},{"key":"302_CR69","unstructured":"Putinar M (1993) Positive polynomials on compact semi-algebraic sets. Indiana Univ Math J"},{"issue":"3","key":"302_CR70","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"MV Ramana","year":"1997","unstructured":"Ramana MV, Tun\u00e7el L, Wolkowicz H (1997) Strong duality for semidefinite programming. SIAM J Optim 7(3):641\u2013662","journal-title":"SIAM J Optim"},{"key":"302_CR71","unstructured":"Reid G, Wang F, Wolkowicz H, Wu W (2016) arxiv:1504.00931 . Accessed on 31 Mar"},{"key":"302_CR72","doi-asserted-by":"crossref","unstructured":"Roux P (2016) Formal proofs of rounding error bounds-with application to an automatic positive definiteness check. J Autom Reason","DOI":"10.1007\/s10817-015-9339-z"},{"key":"#cr-split#-302_CR73.1","doi-asserted-by":"crossref","unstructured":"Roux P, Voronin Y-L, Sankaranarayanan S (2016) Validating numerical semidefinite programming solvers for polynomial invariants. In Xavier R","DOI":"10.1007\/978-3-662-53413-7_21"},{"key":"#cr-split#-302_CR73.2","unstructured":"(ed) Static analysis - 23rd international symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, proceedings, volume 9837 of lecture notes in computer science, pp 424-446. Springer"},{"key":"302_CR74","doi-asserted-by":"crossref","unstructured":"Rump SM (2006) Verification of positive definiteness. BIT Numer Math","DOI":"10.1007\/s10543-006-0056-1"},{"key":"302_CR75","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Sipma H, Manna Z (2008) Constructing invariants for hybrid systems. Formal Methods Syst Des","DOI":"10.1007\/s10703-007-0046-1"},{"key":"302_CR76","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Sipma HB, Manna Z (2005) Scalable analysis of linear systems using mathematical programming. In: VMCAI","DOI":"10.1007\/978-3-540-30579-8_2"},{"key":"302_CR77","unstructured":"Schmieta SH, Pataki G (2016) Reporting solution quality for the DIMACS library of mixed semidefinite-quadratic-linear programs. http:\/\/dimacs.rutgers.edu\/Challenges\/Seventh\/Instances\/error_report.html . [Online; accessed 23 Mar 2016]"},{"key":"302_CR78","doi-asserted-by":"crossref","unstructured":"Sherali HD, Cihan\u00a0H, Tuncbilek CH (1991) A global optimization algorithm for polynomial programming using a reformulation-linearization technique. J Global Optim","DOI":"10.1007\/BF00121304"},{"key":"302_CR79","unstructured":"Shor NZ (1987) Class of global minimum bounds on polynomial functions. Cybernetics 1987. Originally in Russian: Kibernetika"},{"key":"302_CR80","doi-asserted-by":"crossref","unstructured":"Shoukry Y, Nuzzo P, Sangiovanni-Vincentelli AL, Seshia SA, Pappas GJ, Tabuada P (2017) SMC: satisfiability modulo convex optimization. In: Goran F, Sayan M (eds) Proceedings of the 20th international conference on hybrid systems: computation and control, HSCC 2017, Pittsburgh, PA, USA, April 18\u201320, 2017, pages 19\u201328. ACM","DOI":"10.1145\/3049797.3049819"},{"issue":"4","key":"302_CR81","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1137\/S1052623498338606","volume":"10","author":"JF Sturm","year":"2000","unstructured":"Sturm JF (2000) Error bounds for linear matrix inequalities. SIAM J Optim 10(4):1228\u20131248 (electronic)","journal-title":"SIAM J Optim"},{"key":"302_CR82","doi-asserted-by":"crossref","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw","DOI":"10.1080\/10556789908805766"},{"issue":"6","key":"302_CR83","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"JF Sturm","year":"2002","unstructured":"Sturm JF (2002) Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim Methods Softw 17(6):1105\u20131154","journal-title":"Optim Methods Softw"},{"key":"302_CR84","doi-asserted-by":"crossref","unstructured":"Tarski A (1951) A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley, Technical report","DOI":"10.1525\/9780520348097"},{"key":"302_CR85","doi-asserted-by":"crossref","unstructured":"Tuncel L (2010) Polyhedral and semidefinite programming methods in combinatorial optimization. American Mathematical Society","DOI":"10.1090\/fim\/027"},{"key":"302_CR86","doi-asserted-by":"crossref","unstructured":"T\u00fct\u00fcnc\u00fc RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical programming","DOI":"10.1007\/s10107-002-0347-5"},{"issue":"1","key":"302_CR87","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38(1):49\u201395","journal-title":"SIAM Rev"},{"issue":"5","key":"302_CR88","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2010.05.011","volume":"38","author":"H Waki","year":"2010","unstructured":"Waki H, Muramatsu M (2010) A facial reduction algorithm for finding sparse SOS representations. Oper Res Lett 38(5):361\u2013365","journal-title":"Oper Res Lett"},{"issue":"1","key":"302_CR89","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"H Waki","year":"2013","unstructured":"Waki H, Muramatsu M (2013) Facial reduction algorithms for conic optimization problems. J Optim Theory Appl 158(1):188\u2013215","journal-title":"J Optim Theory Appl"},{"key":"302_CR90","doi-asserted-by":"crossref","unstructured":"Waki H, Nakata M, Muramatsu M (2011) Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput Optim Appl","DOI":"10.1007\/s10589-011-9437-8"},{"key":"302_CR91","doi-asserted-by":"crossref","unstructured":"Weispfenning V (1997) Quantifier elimination for real algebra\u2014the quadratic case and beyond. In: Applied algebra and error-correcting codes (AAECC)","DOI":"10.1007\/s002000050055"},{"key":"302_CR92","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0166-218X(99)00102-X","volume":"96\/97","author":"H Wolkowicz","year":"1999","unstructured":"Wolkowicz H, Zhao Q (1999) Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl. Math. 96\/97:461\u2013479 (The satisfiability problem (Certosa di Pontignano, 1996); Boolean functions)","journal-title":"Discrete Appl. Math."},{"key":"302_CR93","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of semidefinite programming","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz H, Saigal R, Vandenberghe L (2000) Handbook of semidefinite programming. Kluwer Academic Publishers, Dordrecht"},{"key":"302_CR94","unstructured":"Yamashita M, Fujisawa K, Nakata K, Nakata M, Fukuda M, Kobayashi K, Goto K (2010) A high-performance software package for semidefinite programs: SDPA 7. Technical Report B-460, Tokyo Institute of Technology"},{"key":"302_CR95","unstructured":"Zhao Q, Karisch SE, Rendl F, Wolkowicz H (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Comb Optim 2(1):71\u2013109. Semidefinite programming and interior-point approaches for combinatorial optimization problems (Toronto, ON, 1996)"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-017-0302-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0302-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0302-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T16:53:14Z","timestamp":1659631994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-017-0302-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,14]]},"references-count":96,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s10703-017-0302-y","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,14]]},"assertion":[{"value":"14 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}