{"id":"https://openalex.org/W3168285534","doi":"https://doi.org/10.1145/3406325.3451128","title":"A framework for quadratic form maximization over convex sets through nonconvex relaxations","display_name":"A framework for quadratic form maximization over convex sets through nonconvex relaxations","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3168285534","doi":"https://doi.org/10.1145/3406325.3451128","mag":"3168285534"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451128","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076002966","display_name":"Vijay Bhattiprolu","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay Bhattiprolu","raw_affiliation_strings":["Institute for Advanced Study at Princeton, USA / Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study at Princeton, USA / Princeton University, USA","institution_ids":["https://openalex.org/I20089843","https://openalex.org/I40036882"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052985577","display_name":"Assaf Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Assaf Naor","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2253,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74960032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"870","last_page":"881"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9944999814033508,"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/oracle","display_name":"Oracle","score":0.6497911214828491},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6313169002532959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6152650713920593},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6122673153877258},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5198374390602112},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.482698917388916},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4638875126838684},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.45453929901123047},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45167699456214905},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44938769936561584},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4358426630496979},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38241058588027954},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36916714906692505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2759275436401367},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06024354696273804}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6497911214828491},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6313169002532959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6152650713920593},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6122673153877258},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5198374390602112},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.482698917388916},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4638875126838684},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.45453929901123047},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45167699456214905},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44938769936561584},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4358426630496979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38241058588027954},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36916714906692505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2759275436401367},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06024354696273804},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451128","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5799999833106995,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G7085497704","display_name":"AF: Medium: Theory of Computation - New Algorithmic and Hardness Techniques","funder_award_id":"1900460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W27619712","https://openalex.org/W80618698","https://openalex.org/W125811033","https://openalex.org/W209159601","https://openalex.org/W288635159","https://openalex.org/W560409768","https://openalex.org/W970507701","https://openalex.org/W1511716344","https://openalex.org/W1521197246","https://openalex.org/W1586488998","https://openalex.org/W1591762700","https://openalex.org/W1604321310","https://openalex.org/W1711896017","https://openalex.org/W1868897294","https://openalex.org/W1952838520","https://openalex.org/W1966586297","https://openalex.org/W1972926842","https://openalex.org/W1976346269","https://openalex.org/W1999797449","https://openalex.org/W2002443286","https://openalex.org/W2010681567","https://openalex.org/W2013200048","https://openalex.org/W2019404063","https://openalex.org/W2019886197","https://openalex.org/W2028932986","https://openalex.org/W2030987833","https://openalex.org/W2045148236","https://openalex.org/W2050991582","https://openalex.org/W2053885701","https://openalex.org/W2056625421","https://openalex.org/W2069172499","https://openalex.org/W2091690227","https://openalex.org/W2100440346","https://openalex.org/W2111405401","https://openalex.org/W2114467398","https://openalex.org/W2114650657","https://openalex.org/W2164071215","https://openalex.org/W2167681887","https://openalex.org/W2175797755","https://openalex.org/W2232305496","https://openalex.org/W2234995292","https://openalex.org/W2300906674","https://openalex.org/W2397159611","https://openalex.org/W2552431851","https://openalex.org/W2599581136","https://openalex.org/W2608702473","https://openalex.org/W2767369866","https://openalex.org/W2798707604","https://openalex.org/W2963120985","https://openalex.org/W2963553534","https://openalex.org/W2963595633","https://openalex.org/W2963957678","https://openalex.org/W2964235642","https://openalex.org/W2970515213","https://openalex.org/W2971201662","https://openalex.org/W3023108254","https://openalex.org/W3038830718","https://openalex.org/W4229813064","https://openalex.org/W4255333822","https://openalex.org/W4293860921","https://openalex.org/W6668521450","https://openalex.org/W6673535661"],"related_works":["https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142","https://openalex.org/W4320477335","https://openalex.org/W1561889708","https://openalex.org/W2275184629","https://openalex.org/W2138044000"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,5,41,44,95,113],"approximability":[3,114],"of":[4,43,63,69,81,112,118],"following":[6],"optimization":[7,64,82],"problem.":[8],"The":[9,34],"input":[10],"is":[11,28,36,57],"an":[12,21],"n\u00d7":[13],"n":[14],"matrix":[15],"A=(Aij)":[16],"with":[17],"real":[18],"entries":[19],"and":[20,60,72,92,115],"origin-symmetric":[22],"convex":[23,73],"body":[24],"K\u2282":[25],"\u211dn":[26],"that":[27],"given":[29],"by":[30],"a":[31,58,78,107],"membership":[32],"oracle.":[33],"task":[35],"to":[37],"compute":[38],"(or":[39],"approximate)":[40],"maximum":[42],"quadratic":[45],"form":[46],"\u2211i=1n\u2211j=1n":[47],"Aij":[48],"xixj=\u27e8":[49],"x,Ax\u27e9":[50],"as":[51],"x":[52],"ranges":[53],"over":[54],"K.":[55],"This":[56],"rich":[59],"expressive":[61],"family":[62],"problems;":[65],"for":[66,110],"different":[67],"choices":[68],"matrices":[70],"A":[71],"bodies":[74],"K":[75],"it":[76],"includes":[77],"diverse":[79],"range":[80],"problems":[83],"like":[84],"max-cut,":[85],"Grothendieck/non-commutative":[86],"Grothendieck":[87],"inequalities,":[88],"small":[89],"set":[90],"expansion":[91],"more.":[93],"While":[94],"literature":[96],"studied":[97],"these":[98,119],"special":[99],"cases":[100],"using":[101],"case-specific":[102],"reasoning,":[103],"here":[104],"we":[105],"develop":[106],"general":[108],"methodology":[109],"treatment":[111],"inapproximability":[116],"aspects":[117],"questions.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}