{"id":"https://openalex.org/W2056337104","doi":"https://doi.org/10.1080/10556780902883184","title":"Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs","display_name":"Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs","publication_year":2009,"publication_date":"2009-04-23","ids":{"openalex":"https://openalex.org/W2056337104","doi":"https://doi.org/10.1080/10556780902883184","mag":"2056337104"},"language":"en","primary_location":{"id":"doi:10.1080/10556780902883184","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780902883184","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5001184606","display_name":"Xiaowei Bao","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaowei Bao","raw_affiliation_strings":["Department of Chemical and Biomolecular Engineering , University of Illinois at Urbana-Champaign , Urbana, IL, 61801, USA","Department of Chemical and Biomolecular Engineering University of Illinois at Urbana\u2010Champaign Urbana IL USA"],"affiliations":[{"raw_affiliation_string":"Department of Chemical and Biomolecular Engineering , University of Illinois at Urbana-Champaign , Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Chemical and Biomolecular Engineering University of Illinois at Urbana\u2010Champaign Urbana IL USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031811254","display_name":"Nikolaos V. Sahinidis","orcid":"https://orcid.org/0000-0003-2087-9131"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":["Department of Chemical Engineering , Carnegie Mellon University , Pittsburgh, PA, 15213, USA","Department of Chemical Engineering Carnegie Mellon University, Pittsburgh, PA  USA"],"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering , Carnegie Mellon University , Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Chemical Engineering Carnegie Mellon University, Pittsburgh, PA  USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001767041","display_name":"Mohit Tawarmalani","orcid":"https://orcid.org/0000-0003-3085-0084"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohit Tawarmalani","raw_affiliation_strings":["Krannert School of Management , Purdue University , West Lafayette, IN, 47907, USA","[Krannert School of Management, Purdue University, West Lafayette, IN, USA]"],"affiliations":[{"raw_affiliation_string":"Krannert School of Management , Purdue University , West Lafayette, IN, 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"[Krannert School of Management, Purdue University, West Lafayette, IN, USA]","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031811254"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":12.7317,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99109236,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"24","issue":"4-5","first_page":"485","last_page":"504"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9901000261306763,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9613999724388123,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.9054830074310303},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.750560998916626},{"id":"https://openalex.org/keywords/bilinear-interpolation","display_name":"Bilinear interpolation","score":0.7442797422409058},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.7273372411727905},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6939153075218201},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.667366623878479},{"id":"https://openalex.org/keywords/envelope","display_name":"Envelope (radar)","score":0.5965669751167297},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5012824535369873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47403669357299805},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.44077742099761963},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4247291088104248},{"id":"https://openalex.org/keywords/ansatz","display_name":"Ansatz","score":0.42101892828941345},{"id":"https://openalex.org/keywords/bilinear-form","display_name":"Bilinear form","score":0.4209742844104767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38791972398757935},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3549301028251648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30646300315856934},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.3033156991004944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3028693199157715},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.30252811312675476},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1829032003879547},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.05949944257736206}],"concepts":[{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.9054830074310303},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.750560998916626},{"id":"https://openalex.org/C205203396","wikidata":"https://www.wikidata.org/wiki/Q612143","display_name":"Bilinear interpolation","level":2,"score":0.7442797422409058},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.7273372411727905},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6939153075218201},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.667366623878479},{"id":"https://openalex.org/C65155139","wikidata":"https://www.wikidata.org/wiki/Q5380912","display_name":"Envelope (radar)","level":3,"score":0.5965669751167297},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5012824535369873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47403669357299805},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.44077742099761963},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4247291088104248},{"id":"https://openalex.org/C130979935","wikidata":"https://www.wikidata.org/wiki/Q568954","display_name":"Ansatz","level":2,"score":0.42101892828941345},{"id":"https://openalex.org/C8828549","wikidata":"https://www.wikidata.org/wiki/Q837924","display_name":"Bilinear form","level":2,"score":0.4209742844104767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38791972398757935},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3549301028251648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30646300315856934},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3033156991004944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3028693199157715},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.30252811312675476},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1829032003879547},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.05949944257736206},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"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/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780902883184","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780902883184","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W40231621","https://openalex.org/W51788365","https://openalex.org/W107346012","https://openalex.org/W114465074","https://openalex.org/W165309352","https://openalex.org/W171437468","https://openalex.org/W988732486","https://openalex.org/W1497465005","https://openalex.org/W1503221585","https://openalex.org/W1512031962","https://openalex.org/W1558506607","https://openalex.org/W1564910180","https://openalex.org/W1606052501","https://openalex.org/W1643070418","https://openalex.org/W1762430620","https://openalex.org/W1963562015","https://openalex.org/W1967959018","https://openalex.org/W1968143987","https://openalex.org/W1968511016","https://openalex.org/W1972168423","https://openalex.org/W1973914437","https://openalex.org/W1978797771","https://openalex.org/W1979690720","https://openalex.org/W1985123706","https://openalex.org/W1995219632","https://openalex.org/W1998221953","https://openalex.org/W1999535820","https://openalex.org/W2018556306","https://openalex.org/W2023672624","https://openalex.org/W2026063499","https://openalex.org/W2026753148","https://openalex.org/W2027006974","https://openalex.org/W2028576516","https://openalex.org/W2031494345","https://openalex.org/W2031978868","https://openalex.org/W2037033044","https://openalex.org/W2043677016","https://openalex.org/W2045622192","https://openalex.org/W2048881327","https://openalex.org/W2050336256","https://openalex.org/W2050523095","https://openalex.org/W2050865875","https://openalex.org/W2061779282","https://openalex.org/W2063190731","https://openalex.org/W2065704444","https://openalex.org/W2067569795","https://openalex.org/W2075161899","https://openalex.org/W2077654805","https://openalex.org/W2081929325","https://openalex.org/W2084006722","https://openalex.org/W2090084096","https://openalex.org/W2091348685","https://openalex.org/W2103962598","https://openalex.org/W2105880662","https://openalex.org/W2107754789","https://openalex.org/W2107969124","https://openalex.org/W2109764733","https://openalex.org/W2114556249","https://openalex.org/W2129790367","https://openalex.org/W2157030448","https://openalex.org/W2271489623","https://openalex.org/W2312608158","https://openalex.org/W2318633240","https://openalex.org/W2509864001","https://openalex.org/W2912522929"],"related_works":["https://openalex.org/W2897697015","https://openalex.org/W3035921962","https://openalex.org/W2169350232","https://openalex.org/W2004392729","https://openalex.org/W2951903936","https://openalex.org/W2566013347","https://openalex.org/W4293088966","https://openalex.org/W2288577150","https://openalex.org/W1878408459","https://openalex.org/W3151409190"],"abstract_inverted_index":{"This":[0],"article":[1],"addresses":[2],"the":[3,17,52,56,70,75,81,84],"generation":[4],"of":[5,20,55,58,62,74,83],"strong":[6],"polyhedral":[7,30],"relaxations":[8,44],"for":[9,32,40],"nonconvex,":[10],"quadratically":[11],"constrained":[12],"quadratic":[13,63],"programs":[14],"(QCQPs).":[15],"Using":[16],"convex":[18,53],"envelope":[19,54],"multilinear":[21],"functions":[22],"as":[23],"our":[24],"starting":[25],"point,":[26],"we":[27],"develop":[28],"a":[29,36],"relaxation":[31,73],"QCQP,":[33],"along":[34],"with":[35],"cutting":[37,86],"plane":[38],"algorithm":[39],"its":[41],"implementation.":[42],"Our":[43],"are":[45,49],"multiterm,":[46],"i.e.":[47],"they":[48],"derived":[50],"from":[51],"sum":[57],"multiple":[59],"bilinear":[60,76],"terms":[61],"constraints,":[64],"thereby":[65],"providing":[66],"tighter":[67],"bounds":[68],"than":[69],"standard":[71],"termwise":[72],"functions.":[77],"Computational":[78],"results":[79],"demonstrate":[80],"usefulness":[82],"proposed":[85],"planes.":[87]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":15}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
