{"id":"https://openalex.org/W2059380806","doi":"https://doi.org/10.1137/100802190","title":"Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs","display_name":"Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2059380806","doi":"https://doi.org/10.1137/100802190","mag":"2059380806"},"language":"en","primary_location":{"id":"doi:10.1137/100802190","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100802190","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084563518","display_name":"Bissan Ghaddar","orcid":"https://orcid.org/0000-0003-4695-200X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bissan Ghaddar","raw_affiliation_strings":["bghaddar@uwaterloo.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"bghaddar@uwaterloo.ca#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002345780","display_name":"Juan C. Vera","orcid":"https://orcid.org/0000-0003-1394-3422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juan C. Vera","raw_affiliation_strings":["j.c.veralizcano@uvt.nl#TAB#"],"affiliations":[{"raw_affiliation_string":"j.c.veralizcano@uvt.nl#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["anjos@stanfordalumni.org#TAB#"],"affiliations":[{"raw_affiliation_string":"anjos@stanfordalumni.org#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084563518"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2935,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86894771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"21","issue":"1","first_page":"391","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7166243195533752},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7105780839920044},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6905751824378967},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6473363637924194},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.5935462117195129},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5824042558670044},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5759055018424988},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5622687339782715},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5177637338638306},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4956709146499634},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.46039336919784546},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.43634480237960815},{"id":"https://openalex.org/keywords/binary-quadratic-form","display_name":"Binary quadratic form","score":0.43006622791290283},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4287925064563751},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4201367199420929},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36692574620246887},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35380488634109497},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3425154983997345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3247772753238678},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11946925520896912},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.08080947399139404},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.07310226559638977},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06895563006401062}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7166243195533752},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7105780839920044},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6905751824378967},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6473363637924194},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.5935462117195129},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5824042558670044},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5759055018424988},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5622687339782715},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5177637338638306},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4956709146499634},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.46039336919784546},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.43634480237960815},{"id":"https://openalex.org/C80695182","wikidata":"https://www.wikidata.org/wiki/Q864134","display_name":"Binary quadratic form","level":4,"score":0.43006622791290283},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4287925064563751},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4201367199420929},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36692574620246887},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35380488634109497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3425154983997345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3247772753238678},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11946925520896912},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.08080947399139404},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.07310226559638977},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06895563006401062},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/100802190","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100802190","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/40db89bb-3645-4922-b064-54d1b6b0dedd","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/40db89bb-3645-4922-b064-54d1b6b0dedd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ghaddar, B, Vera, J C & Anjos, M F 2011, 'Second-order cone relaxations for binary quadratic polynomial programs', SIAM Journal on Optimization, vol. 21, no. 1, pp. 391-414. https://doi.org/10.1137/100802190","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.623.8783","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.623.8783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2009/10/2444.pdf","raw_type":"text"},{"id":"pmh:oai:publications.polymtl.ca:16847","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/16847/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W572922989","https://openalex.org/W1501516191","https://openalex.org/W1606052501","https://openalex.org/W1967073510","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1970801029","https://openalex.org/W1997672673","https://openalex.org/W2002576503","https://openalex.org/W2031978868","https://openalex.org/W2035949967","https://openalex.org/W2037417853","https://openalex.org/W2043677016","https://openalex.org/W2049087128","https://openalex.org/W2051598459","https://openalex.org/W2054908450","https://openalex.org/W2057162710","https://openalex.org/W2060252799","https://openalex.org/W2074078071","https://openalex.org/W2082782506","https://openalex.org/W2084512390","https://openalex.org/W2087999447","https://openalex.org/W2094995801","https://openalex.org/W2103327612","https://openalex.org/W2106264302","https://openalex.org/W2120146316","https://openalex.org/W2122604873","https://openalex.org/W2124038748","https://openalex.org/W2133404041","https://openalex.org/W2133602590","https://openalex.org/W2140214428","https://openalex.org/W2159739530","https://openalex.org/W2250294758","https://openalex.org/W2962725330","https://openalex.org/W4242858928","https://openalex.org/W4255442211"],"related_works":["https://openalex.org/W1994114596","https://openalex.org/W2492346510","https://openalex.org/W2054908450","https://openalex.org/W2809483977","https://openalex.org/W2785023074","https://openalex.org/W3004001938","https://openalex.org/W2238847421","https://openalex.org/W1506892290","https://openalex.org/W2059380806","https://openalex.org/W3121628881"],"abstract_inverted_index":{"Several":[0],"types":[1],"of":[2,85,95,144,171,180],"relaxations":[3,30,57,81,103,162],"for":[4,31,58,82,104,124],"binary":[5,32,59,87,105,146],"quadratic":[6,33,60,88,106,147,151],"polynomial":[7,34,38,61,89,107,148],"programs":[8,35],"can":[9,109],"be":[10,110],"obtained":[11],"using":[12],"linear,":[13],"second-order":[14,69,136],"cone,":[15],"or":[16],"semidefinite":[17,72],"techniques.":[18],"In":[19,52],"this":[20],"paper,":[21],"we":[22,43,54,128],"propose":[23,129],"a":[24,75,92,130],"general":[25],"framework":[26],"to":[27,98,113,116],"construct":[28],"conic":[29],"based":[36,67,133],"on":[37,68,135,141],"programming.":[39,138],"Using":[40],"our":[41],"framework,":[42],"re-derive":[44],"previous":[45,79],"relaxation":[46,132,158],"schemes":[47],"and":[48,71,174],"provide":[49],"new":[50],"ones.":[51],"particular,":[53],"present":[55],"three":[56],"programs.":[62],"The":[63],"first":[64],"two":[65],"relaxations,":[66],"cone":[70,137],"programming,":[73],"represent":[74],"significant":[76],"improvement":[77],"over":[78],"practical":[80,93],"several":[83],"classes":[84,143],"nonconvex":[86,145],"problems.":[90],"From":[91],"point":[94],"view,":[96],"due":[97],"the":[99,121,156,160,167],"computational":[100,122,172],"cost,":[101],"semidefinite-based":[102,161],"problems":[108],"used":[111],"only":[112],"solve":[114],"small":[115],"midsize":[117],"instances.":[118],"To":[119],"improve":[120],"efficiency":[123],"solving":[125],"such":[126],"problems,":[127,149,153],"third":[131],"purely":[134],"Computational":[139],"tests":[140],"different":[142],"including":[150],"knapsack":[152],"show":[154],"that":[155,163],"second-order-cone-based":[157],"outperforms":[159],"are":[164],"proposed":[165],"in":[166,169,178],"literature":[168],"terms":[170,179],"efficiency,":[173],"it":[175],"is":[176],"comparable":[177],"bounds.":[181]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}