{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:02:50Z","timestamp":1751860970640,"version":"3.41.0"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T00:00:00Z","timestamp":1536019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T00:00:00Z","timestamp":1536019200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["SHF 1527075"],"award-info":[{"award-number":["SHF 1527075"]}],"id":[{"id":"10.13039\/100000083","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":[[2019,8]]},"DOI":"10.1007\/s10703-018-0323-1","type":"journal-article","created":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T15:13:14Z","timestamp":1536073994000},"page":"27-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Template polyhedra and bilinear optimization"],"prefix":"10.1007","volume":"54","author":[{"given":"Jessica","family":"Gronski","sequence":"first","affiliation":[]},{"given":"Mohamed-Amin","family":"Ben Sassi","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Becker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7315-4340","authenticated-orcid":false,"given":"Sriram","family":"Sankaranarayanan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,4]]},"reference":[{"key":"323_CR1","doi-asserted-by":"crossref","unstructured":"Adj\u00e9 A, Garoche P (2015) Automatic synthesis of piecewise linear quadratic invariants for programs. In: Verification, model checking, and abstract interpretation (VMCAI), pp 99\u2013116","DOI":"10.1007\/978-3-662-46081-8_6"},{"key":"323_CR2","doi-asserted-by":"publisher","unstructured":"Adj\u00e9 A, Gaubert S, Goubault E (2012) Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. LMCS. https:\/\/doi.org\/10.2168\/LMCS-8(1:01)2012","DOI":"10.2168\/LMCS-8(1:01)2012"},{"issue":"1","key":"323_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.jmaa.2013.07.076","volume":"410","author":"A Adj\u00e9","year":"2014","unstructured":"Adj\u00e9 A, Gaubert S, Goubault E (2014) Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs. J Math Anal Appl 410(1):227\u2013240","journal-title":"J Math Anal Appl"},{"key":"323_CR4","first-page":"134","volume-title":"Deriving numerical abstract domains via principal component analysis","author":"G Amato","year":"2010","unstructured":"Amato G, Parton M, Scozzari F (2010) Deriving numerical abstract domains via principal component analysis. Springer, Berlin, pp 134\u2013150"},{"issue":"2","key":"323_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher KM (2009) Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J Glob Optim 43(2):471\u2013484","journal-title":"J Glob Optim"},{"issue":"1","key":"323_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet C, Hansen P, Jaumard B, Savard G (2000) A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math Program 87(1):131\u2013152","journal-title":"Math Program"},{"key":"323_CR7","unstructured":"Bagnara R, Hill PM, Zaffanella E (2006) The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Quaderno 457, Dipartimento di Matematica, Universit\u00e0 di Parma, Italy"},{"key":"323_CR8","doi-asserted-by":"crossref","unstructured":"Bagnara R, Ricci E, Zaffanella E, Hill PM (2002) Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Static analysis symposium, vol 2477, pp 213\u2013229","DOI":"10.1007\/3-540-45789-5_17"},{"key":"323_CR9","unstructured":"Belotti P (2009) Couenne: a users manual. Technical report, Lehigh University"},{"key":"323_CR10","volume-title":"Convex analysis and optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas DP, Nedi\u0107 A, Ozdaglar AE (2003) Convex analysis and optimization. Athena Scientific, Belmont"},{"key":"323_CR11","doi-asserted-by":"crossref","unstructured":"Blanchet B, Cousot P, Cousot R, Feret J, Mauborgne L, Min\u00e9 A, Monniaux D, Rival X (2003) A static analyzer for large safety-critical software. In: Programming language design and implementation, pp 196\u2013207. ACM Press","DOI":"10.1145\/780822.781153"},{"key":"323_CR12","doi-asserted-by":"crossref","unstructured":"Blanchet B, Cousot P, Cousot R, Feret J, Mauborgne L, Min\u00e9 A, Monniaux D, Rival X (2005) Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software (invited chapter). In: In The essence of computation: complexity, analysis, transformation. Essays dedicated to Neil D. Jones. LNCS, vol. 2566, pp 85\u2013108. Springer","DOI":"10.1007\/3-540-36377-7_5"},{"key":"323_CR13","doi-asserted-by":"crossref","unstructured":"Bogomolov S, Frehse G, Giacobbe M, Henzinger T (2017) Counterexample-guided refinement of template polyhedra. In: International conference on tools and algorithms for the construction and analysis of systems. Springer, Berlin","DOI":"10.1007\/978-3-662-54577-5_34"},{"issue":"2","key":"323_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami P, Biegler LT, Conn AR, Cornu\u00e9jols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim 5(2):186\u2013204","journal-title":"Discrete Optim"},{"issue":"5","key":"323_CR15","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd RH, Lu P, Nocedal J (1995) A limited memory algorithm for bound constrained optimization. SIAM J Sci Stat Comput 16(5):1190\u20131208","journal-title":"SIAM J Sci Stat Comput"},{"key":"323_CR16","doi-asserted-by":"crossref","unstructured":"Chen X, Abraham E, Sankaranarayanan S (2012) Taylor model flowpipe construction for non-linear hybrid systems. In: Real time systems symposium (RTSS), pp 183\u2013192. IEEE Press","DOI":"10.1109\/RTSS.2012.70"},{"key":"323_CR17","doi-asserted-by":"crossref","unstructured":"Chen X, Erika \u00c1 (2012) Choice of directions for the approximation of reachable sets for hybrid systems. In: EUROCAST\u201911, pp 535\u2013542. Springer, Berlin","DOI":"10.1007\/978-3-642-27549-4_69"},{"key":"323_CR18","volume-title":"Linear programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal V (1983) Linear programming. Freeman, San Francisco"},{"issue":"1","key":"323_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2006.03.009","volume":"64","author":"R Clariso","year":"2007","unstructured":"Clariso R, Cortadella J (2007) The octahedron abstract domain. Sci Comput Program 64(1):115\u2013139","journal-title":"Sci Comput Program"},{"key":"323_CR20","doi-asserted-by":"crossref","unstructured":"Col\u00f3n M, Sankaranarayanan S, Sipma H (2003) Linear invariant generation using non-linear constraint solving. In: CAV, vol 2725, pp 420\u2013433","DOI":"10.1007\/978-3-540-45069-6_39"},{"key":"323_CR21","doi-asserted-by":"crossref","unstructured":"Costan A, Gaubert S, Goubault E, Martel M, Putot S (2005) A policy iteration algorithm for computing fixed points in static analysis of programs. In: Computer aided verification (CAV). Lecture notes in computer science, vol 3576, pp 462\u2013475. Springer","DOI":"10.1007\/11513988_46"},{"key":"323_CR22","unstructured":"Couenne, a solver for nonconvex minlp problems (2016). https:\/\/www.coin-or.org\/Couenne\/ . Accessed 1 Sep 2018"},{"key":"323_CR23","doi-asserted-by":"crossref","unstructured":"Cousot P (2005) Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In: VMCAI. Lecture notes in computer science, vol 3385, pp 1\u201324. Springer","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"323_CR24","unstructured":"Cousot P, Cousot R (1976) Static determination of dynamic properties of programs. In: Proc. ISOP\u201976. Dunod, Paris, pp 106\u2013130"},{"key":"323_CR25","doi-asserted-by":"crossref","unstructured":"Cousot P, Cousot R (1992) Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation, invited paper. In: PLILP\u201992. LNCS, vol 631, pp 269\u2013295. Springer","DOI":"10.1007\/3-540-55844-6_142"},{"key":"323_CR26","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: ACM principles of programming languages, pp 238\u2013252","DOI":"10.1145\/512950.512973"},{"key":"323_CR27","unstructured":"Dauphin YN, Pascanu R, Gulcehre C, Cho K, Ganguli S, Bengio Y (2014) Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In: Advances in neural information processing systems, pp 2933\u20132941"},{"key":"323_CR28","doi-asserted-by":"crossref","unstructured":"Delmas D, Souyris J (2007) Astr\u00e9e: from research to industry. In: Proceedings of 14th international static analysis symposium, SAS 2007. LNCS, vol 4634, pp 437\u2013451. Springer, Berlin","DOI":"10.1007\/978-3-540-74061-2_27"},{"key":"323_CR29","doi-asserted-by":"crossref","unstructured":"Frehse G, Le Guernic C, Donz\u00e9 A, Cotton S, Ray R, Lebeltel O, Ripado R, Girard A, Dang T, Maler O (2011) SpaceEx: scalable verification of hybrid systems. In: Proceedings of CAV\u201911, vol 6806, pp 379\u2013395","DOI":"10.1007\/978-3-642-22110-1_30"},{"key":"323_CR30","doi-asserted-by":"crossref","unstructured":"Gaubert S, Goubault E, Taly A, Zennou S (2007) Static analysis by policy iteration on relational domains. In: European symposium on programming. Lecture notes in computer science, vol 4421, pp 237\u2013252. Springer","DOI":"10.1007\/978-3-540-71316-6_17"},{"key":"323_CR31","doi-asserted-by":"crossref","unstructured":"Gawlitza T, Seidl H (2007) Precise fixpoint computation through strategy iteration. In: European symposium on programming (ESOP). Lecture notes in computer science, vol 4421, pp 300\u2013315. Springer","DOI":"10.1007\/978-3-540-71316-6_21"},{"issue":"3","key":"323_CR32","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1961204.1961207","volume":"33","author":"TM Gawlitza","year":"2011","unstructured":"Gawlitza TM, Seidl H (2011) Solving systems of rational equations through strategy iteration. ACM Trans Program Lang Syst 33(3):11:1\u201311:48","journal-title":"ACM Trans Program Lang Syst"},{"key":"323_CR33","unstructured":"Ghaoui LE, Balakrishnan V (1994) Synthesis of fixed-structure controllers via numerical optimization. In: Proceedings of the 33rd conference on decision and control (CDC). IEEE"},{"key":"323_CR34","doi-asserted-by":"crossref","unstructured":"Goubault E, Putot S, Baufreton P, Gassino J (2008) Static analysis of the accuracy in control systems: principles and experiments. In: FMICS. LNCS, vol 4916, pp 3\u201320. Springer","DOI":"10.1007\/978-3-540-79707-4_3"},{"key":"323_CR35","doi-asserted-by":"crossref","unstructured":"Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Recent advances in learning and control, pp 95\u2013110","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"323_CR36","unstructured":"Grant M, Boyd S, Ye Y (2008) Cvx: Matlab software for disciplined convex programming"},{"issue":"2","key":"323_CR37","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.nahs.2009.03.002","volume":"4","author":"CL Guernic","year":"2010","unstructured":"Guernic CL, Girard A (2010) Reachability analysis of linear systems using support functions. Nonlinear Anal Hybrid Syst 4(2):250\u2013262","journal-title":"Nonlinear Anal Hybrid Syst"},{"key":"323_CR38","doi-asserted-by":"crossref","unstructured":"Gulwani S, Srivastava S, Venkatesan R (2008) Program analysis as constraint solving. In: PLDI, pp 281\u2013292. ACM","DOI":"10.1145\/1379022.1375616"},{"key":"323_CR39","unstructured":"Gurobi Optimization Inc. (2017) Gurobi optimizer reference manual. http:\/\/www.gurobi.com . Accessed 1 Sep 2018"},{"key":"323_CR40","doi-asserted-by":"crossref","unstructured":"Helton J, Merino O (1997) Coordinate optimization for bi-convex matrix inequalities. In: IEEE conference on decision and control (CDC), pp 3609\u20133613","DOI":"10.1109\/CDC.1997.652414"},{"key":"323_CR41","unstructured":"Jin C, Ge R, Netrapalli P, Kakade SM, Jordan MI (2017) How to escape saddle points efficiently. In: ICML"},{"issue":"3\u20134","key":"323_CR42","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/10556780108805819","volume":"15","author":"S Kim","year":"2001","unstructured":"Kim S, Kojima M (2001) Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim Methods Soft 15(3\u20134):201\u2013224","journal-title":"Optim Methods Soft"},{"issue":"3","key":"323_CR43","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Ko\u010dvara","year":"2003","unstructured":"Ko\u010dvara M, Stingl M (2003) PENNON: a code for convex nonlinear and semidefinite programming. Optim Methods Softw 18(3):317\u2013333","journal-title":"Optim Methods Softw"},{"key":"323_CR44","unstructured":"Lee JD, Simchowitz M, Jordan MI, Recht B (2016) Gradient descent only converges to minimizers. In: Conference on learning theory, pp 1246\u20131257"},{"issue":"2","key":"323_CR45","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2):251\u2013282","journal-title":"Math Program"},{"key":"323_CR46","doi-asserted-by":"crossref","unstructured":"Logozzo F, F\u00e4hndrich M (2008) Pentagons: a weakly relational abstract domain for the efficient validation of array accesses. In: Symposium on applied computing, SAC \u201908. ACM, New York, pp 184\u2013188","DOI":"10.1145\/1363686.1363736"},{"key":"323_CR47","unstructured":"Mathworks Inc. PolySpace design verifier. http:\/\/www.mathworks.com\/products\/polyspace\/ . Accessed Apr 2017"},{"key":"323_CR48","doi-asserted-by":"crossref","unstructured":"Min\u00e9 A (2001) A new numerical abstract domain based on difference-bound matrices. In: PADO II, vol 2053, pp 155\u2013172","DOI":"10.1007\/3-540-44978-7_10"},{"key":"323_CR49","doi-asserted-by":"crossref","unstructured":"Min\u00e9 A (October 2001) The octagon abstract domain. In: AST 2001 in WCRE 2001. IEEE, IEEE CS Press, pp 310\u2013319","DOI":"10.1109\/WCRE.2001.957836"},{"key":"323_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of program analysis","author":"F Nielson","year":"1999","unstructured":"Nielson F, Nielson HR, Hankin C (1999) Principles of program analysis. Springer, Berlin"},{"key":"323_CR51","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright S (2006) Numerical optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"323_CR52","unstructured":"Park J, Boyd S (2017) General heuristics for nonconvex quadratically constrained quadratic programming. arXiv preprint arXiv:1703.07870"},{"key":"323_CR53","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-1-4614-1927-3_14","volume-title":"Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications","author":"A Qualizza","year":"2012","unstructured":"Qualizza A, Belotti P, Margot F (2012) Linear programming relaxations of quadratically constrained quadratic programs. In: Lee J, Leyffer S (eds) Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications. Springer, Berlin, pp 407\u2013426"},{"key":"323_CR54","volume-title":"Variational analysis","author":"R Rockafellar","year":"2009","unstructured":"Rockafellar R, Wets R (2009) Variational analysis. Springer, Berlin"},{"key":"323_CR55","doi-asserted-by":"crossref","unstructured":"Roux P, Voronin YL, Sankaranarayanan S (2016) Validating numerical semidefinite programming solvers for polynomial invariants. In: Static analysis symposium (SAS). Lecture notes in computer science, vol 9837, pp 424\u2013446. Springer","DOI":"10.1007\/978-3-662-53413-7_21"},{"key":"323_CR56","unstructured":"Sahinidis NV (2017) BARON 17.8.9: global optimization of mixed-integer nonlinear programs. User\u2019s manual"},{"key":"323_CR57","unstructured":"Sankaranarayanan S (2005) Mathematical analysis of programs. PhD thesis, Stanford University"},{"key":"323_CR58","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Dang T, Ivan\u010di\u0107 F (2008) Symbolic model checking of hybrid systems using template polyhedra. In: TACAS. LNCS, vol 4963, pp 188\u2013202. Springer","DOI":"10.1007\/978-3-540-78800-3_14"},{"key":"323_CR59","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Sipma HB, Manna Z (2004) Constraint-based linear-relations analysis. In: Static analysis symposium (SAS 2004), vol 3148, pp 53\u201369, Aug 2017","DOI":"10.1007\/978-3-540-27864-1_7"},{"key":"323_CR60","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Sipma HB, Manna Z (2005) Scalable analysis of linear systems using mathematical programming. In: Verification, model-checking and abstract-interpretation (VMCAI 2005), vol 3385, Jan 2005","DOI":"10.1007\/978-3-540-30579-8_2"},{"key":"323_CR61","doi-asserted-by":"crossref","unstructured":"Sassi MAB, Girard A, Sankaranarayanan S (2014) Iterative computation of polyhedral invariants sets for polynomial dynamical systems. In: IEEE conference on decision and control (CDC), pp 6348\u20136353. IEEE Press","DOI":"10.1109\/CDC.2014.7040384"},{"key":"323_CR62","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1093\/imamci\/dnv003","volume":"33","author":"MAB Sassi","year":"2016","unstructured":"Sassi MAB, Sankaranarayanan S, Chen X, \u00c1braham E (2016) Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis. IMA J Math Control Inf 33:723\u2013756","journal-title":"IMA J Math Control Inf"},{"issue":"3","key":"323_CR63","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-011-9757-3","volume":"52","author":"HD Sherali","year":"2012","unstructured":"Sherali HD, Dalkiran E, Liberti L (2012) Reduced rlt representations for nonconvex polynomial programming problems. J Glob Optim 52(3):447\u2013469","journal-title":"J Glob Optim"},{"issue":"1","key":"323_CR64","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali HD, Fraticelli BM (2002) Enhancing rlt relaxations via a new class of semidefinite cuts. J Glob Optim 22(1):233\u2013261","journal-title":"J Glob Optim"},{"issue":"1\u20134","key":"323_CR65","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim Methods Softw 11(1\u20134):625\u2013653","journal-title":"Optim Methods Softw"},{"key":"323_CR66","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Program 103:225\u2013249","journal-title":"Math Program"},{"key":"323_CR67","doi-asserted-by":"crossref","unstructured":"Venet A, Brat GP (2004) Precise and efficient static array bound checking for large embedded C programs. In: PLDI, pp 231\u2013242. ACM","DOI":"10.1145\/996893.996869"},{"issue":"1","key":"323_CR68","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106(1):25\u201357","journal-title":"Math Program"},{"key":"323_CR69","doi-asserted-by":"crossref","unstructured":"Weispfenning V (1997) Quantifier elimination for real algebra\u2013the quadratic case and beyond. In: Applied algebra and error-correcting codes (AAECC), vol 8, pp 85\u2013101","DOI":"10.1007\/s002000050055"},{"issue":"2","key":"323_CR70","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-011-0466-y","volume":"129","author":"XJ Zheng","year":"2011","unstructured":"Zheng XJ, Sun XL, Li D (2011) Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math Program 129(2):301\u2013329","journal-title":"Math Program"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-018-0323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-018-0323-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-018-0323-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T21:16:24Z","timestamp":1751836584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-018-0323-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,4]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["323"],"URL":"https:\/\/doi.org\/10.1007\/s10703-018-0323-1","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2018,9,4]]},"assertion":[{"value":"4 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}