{"id":"https://openalex.org/W2559883687","doi":"https://doi.org/10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","display_name":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","publication_year":2016,"publication_date":"2016-12-10","ids":{"openalex":"https://openalex.org/W2559883687","doi":"https://doi.org/10.1007/s10107-016-1095-2","mag":"2559883687"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-016-1095-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-1095-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5100418572","display_name":"Chen Chen","orcid":"https://orcid.org/0000-0003-4148-2352"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen Chen","raw_affiliation_strings":["Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008007328","display_name":"Alper Atamt\u00fcrk","orcid":"https://orcid.org/0000-0003-1220-808X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alper Atamt\u00fcrk","raw_affiliation_strings":["Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032857095","display_name":"Shmuel S. Oren","orcid":"https://orcid.org/0000-0001-6065-9892"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shmuel S. Oren","raw_affiliation_strings":["Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, University of California, Berkeley, CA, 94720-1777, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008007328"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.9086,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97229472,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"165","issue":"2","first_page":"549","last_page":"577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9805999994277954,"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/T12288","display_name":"Optimization and Search Problems","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.822035014629364},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7338576912879944},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6020640730857849},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.5784412026405334},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5724796056747437},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5191287398338318},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4910287857055664},{"id":"https://openalex.org/keywords/hermitian-matrix","display_name":"Hermitian matrix","score":0.48684757947921753},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.457963764667511},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4513595700263977},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.4473226070404053},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4328121840953827},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4209533631801605},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.33597585558891296},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2861170172691345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21848905086517334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1873881220817566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10165917873382568}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.822035014629364},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7338576912879944},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6020640730857849},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5784412026405334},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5724796056747437},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5191287398338318},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4910287857055664},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.48684757947921753},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.457963764667511},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4513595700263977},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4473226070404053},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4328121840953827},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4209533631801605},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.33597585558891296},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2861170172691345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21848905086517334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1873881220817566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10165917873382568},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-016-1095-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-1095-2","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G4592209612","display_name":null,"funder_award_id":"FA9550-10-1-0168","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320321487","display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320332201","display_name":"Office of the Secretary of Defense","ror":"https://ror.org/00q4sx826"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W602904462","https://openalex.org/W1481640635","https://openalex.org/W1486258796","https://openalex.org/W1596877211","https://openalex.org/W1838590309","https://openalex.org/W1859065560","https://openalex.org/W1969807530","https://openalex.org/W1973360868","https://openalex.org/W1978378863","https://openalex.org/W1978496689","https://openalex.org/W1988622494","https://openalex.org/W1997197201","https://openalex.org/W2000923338","https://openalex.org/W2001741445","https://openalex.org/W2006704773","https://openalex.org/W2008322528","https://openalex.org/W2021674665","https://openalex.org/W2025308368","https://openalex.org/W2026964350","https://openalex.org/W2034356527","https://openalex.org/W2056337104","https://openalex.org/W2060514920","https://openalex.org/W2063190731","https://openalex.org/W2065849120","https://openalex.org/W2071143636","https://openalex.org/W2075161899","https://openalex.org/W2077230226","https://openalex.org/W2086664392","https://openalex.org/W2093229781","https://openalex.org/W2105880662","https://openalex.org/W2106264302","https://openalex.org/W2106424475","https://openalex.org/W2108927308","https://openalex.org/W2113280143","https://openalex.org/W2118807841","https://openalex.org/W2123871098","https://openalex.org/W2128757878","https://openalex.org/W2133304166","https://openalex.org/W2141380252","https://openalex.org/W2142067208","https://openalex.org/W2145080587","https://openalex.org/W2154890268","https://openalex.org/W2169053534","https://openalex.org/W2170540951","https://openalex.org/W2201293300","https://openalex.org/W2342459388","https://openalex.org/W2475792797","https://openalex.org/W2536620281","https://openalex.org/W2553087624","https://openalex.org/W4255781802","https://openalex.org/W6634721097"],"related_works":["https://openalex.org/W2004392729","https://openalex.org/W4298879965","https://openalex.org/W2951903936","https://openalex.org/W2233303476","https://openalex.org/W2492346510","https://openalex.org/W2169350232","https://openalex.org/W2566013347","https://openalex.org/W2022619808","https://openalex.org/W3021329353","https://openalex.org/W2036774300"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2025-10-10T00:00:00"}