{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1362262946432104576.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/s13675-018-0101-2"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s13675-018-0101-2.pdf"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/article/10.1007/s13675-018-0101-2/fulltext.html"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S2192440621001143?httpAccept=text/xml"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:S2192440621001143?httpAccept=text/plain"}}],"dc:title":[{"@value":"Alternative SDP and SOCP approximations for polynomial optimization"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1382262946432104578","@type":"Researcher","foaf:name":[{"@value":"Xiaolong Kuang"}]},{"@id":"https://cir.nii.ac.jp/crid/1382262946432104579","@type":"Researcher","foaf:name":[{"@value":"Bissan Ghaddar"}]},{"@id":"https://cir.nii.ac.jp/crid/1382262946432104577","@type":"Researcher","foaf:name":[{"@value":"Joe Naoum-Sawaya"}]},{"@id":"https://cir.nii.ac.jp/crid/1382262946432104576","@type":"Researcher","foaf:name":[{"@value":"LuisF. Zuluaga"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"21924406"}],"prism:publicationName":[{"@value":"EURO Journal on Computational Optimization"}],"dc:publisher":[{"@value":"Elsevier BV"}],"prism:publicationDate":"2019-06","prism:volume":"7","prism:number":"2","prism:startingPage":"153","prism:endingPage":"175"},"reviewed":"false","dc:rights":["https://www.elsevier.com/tdm/userlicense/1.0/","https://www.elsevier.com/legal/tdmrep-license"],"url":[{"@id":"http://link.springer.com/content/pdf/10.1007/s13675-018-0101-2.pdf"},{"@id":"http://link.springer.com/article/10.1007/s13675-018-0101-2/fulltext.html"},{"@id":"https://api.elsevier.com/content/article/PII:S2192440621001143?httpAccept=text/xml"},{"@id":"https://api.elsevier.com/content/article/PII:S2192440621001143?httpAccept=text/plain"}],"createdAt":"2018-08-13","modifiedAt":"2025-10-31","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360853567364882560","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/s13675-018-0101-2"},{"@type":"CROSSREF","@value":"10.1080/10556788.2020.1827256_references_DOI_NR5UdOfYXrRRqHlpblBLT4EauEi"}]}