{"id":"https://openalex.org/W2984167989","doi":"https://doi.org/10.1080/10556788.2020.1827256","title":"Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems","display_name":"Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems","publication_year":2020,"publication_date":"2020-09-29","ids":{"openalex":"https://openalex.org/W2984167989","doi":"https://doi.org/10.1080/10556788.2020.1827256","mag":"2984167989"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2020.1827256","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1827256","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.02188","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Heejune Sheen","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Heejune Sheen","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":null,"display_name":"Makoto Yamashita","orcid":"https://orcid.org/0000-0002-8409-036X"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Makoto Yamashita","raw_affiliation_strings":["Department of Mathematical and Computing Science, Tokyo Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0002-8409-036X","affiliations":[{"raw_affiliation_string":"Department of Mathematical and Computing Science, Tokyo Institute of Technology","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":null,"apc_paid":null,"fwci":1.1592,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74122391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"37","issue":"2","first_page":"753","last_page":"771"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.909600019454956,"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.909600019454956,"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.032600000500679016,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.8062000274658203},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6424999833106995},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6340000033378601},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6241999864578247},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.6085000038146973},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5356000065803528},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3950999975204468},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.37950000166893005}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8062000274658203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6797000169754028},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6424999833106995},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6340000033378601},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6241999864578247},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.6085000038146973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5748000144958496},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5356000065803528},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.37040001153945923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36250001192092896},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C49712288","wikidata":"https://www.wikidata.org/wiki/Q77601250","display_name":"Positive-definite matrix","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C2780554755","wikidata":"https://www.wikidata.org/wiki/Q955260","display_name":"Relaxation technique","level":3,"score":0.2978000044822693},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.2639999985694885},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2020.1827256","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1827256","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"},{"id":"pmh:oai:arXiv.org:1911.02188","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.02188","pdf_url":"https://arxiv.org/pdf/1911.02188","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.02188","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.02188","pdf_url":"https://arxiv.org/pdf/1911.02188","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6090864554","display_name":"Efficient optimization method for optimal contribution problems with semi-integer constraints","funder_award_id":"18K11176","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W10800830","https://openalex.org/W34399546","https://openalex.org/W1606052501","https://openalex.org/W1632601927","https://openalex.org/W1967073510","https://openalex.org/W1972604748","https://openalex.org/W1985123706","https://openalex.org/W2006704773","https://openalex.org/W2009923109","https://openalex.org/W2010876555","https://openalex.org/W2014663083","https://openalex.org/W2019855902","https://openalex.org/W2027470314","https://openalex.org/W2030686911","https://openalex.org/W2043677016","https://openalex.org/W2049444669","https://openalex.org/W2071143636","https://openalex.org/W2077924482","https://openalex.org/W2080795645","https://openalex.org/W2087260200","https://openalex.org/W2106264302","https://openalex.org/W2132402006","https://openalex.org/W2146826069","https://openalex.org/W2164220355","https://openalex.org/W2259690454","https://openalex.org/W2563370187","https://openalex.org/W2952789813","https://openalex.org/W2963068174","https://openalex.org/W2973618826","https://openalex.org/W2987307294","https://openalex.org/W4250589301"],"related_works":[],"abstract_inverted_index":{"Among":[0],"many":[1],"approaches":[2],"to":[3],"increase":[4],"the":[5,22,26,30,68,82,86,92,100,114,120,129,142,147,154,158,162,166,171,182,187],"computational":[6,159],"efficiency":[7,160],"of":[8,25,71,74,88,113,161],"semidefinite":[9,39],"programming":[10,18,40,57],"(SDP)":[11],"relaxation":[12,59,73,116,164,185],"for":[13,165],"nonconvex":[14,75,126],"quadratic":[15,17],"constrained":[16],"problems":[19,177],"(QCQPs),":[20],"exploiting":[21,81,153],"aggregate":[23,69,83,155],"sparsity":[24,37,70,84,156],"data":[27],"matrices":[28],"in":[29,38,91,108],"SDP":[31,148,172,188],"by":[32,104,181],"Fukuda":[33,105],"et":[34,106],"al.":[35,107],"[Exploiting":[36],"via":[41],"matrix":[42,101],"completion":[43,102],"I:":[44],"General":[45],"framework,":[46],"SIAM":[47],"J.":[48],"Optim.":[49],"11(3)":[50],"(2001),":[51],"pp.":[52],"647\u2013674]":[53],"and":[54,95,111,132],"second-order":[55,89],"cone":[56],"(SOCP)":[58],"have":[60],"been":[61],"popular.":[62],"In":[63],"this":[64],"paper,":[65],"we":[66,78,97],"exploit":[67],"SOCP":[72,93,115,139,163,184],"QCQPs.":[76],"Specifically,":[77],"prove":[79],"that":[80,96,152],"reduces":[85],"number":[87],"cones":[90],"relaxation,":[94,173],"can":[98,178],"simplify":[99],"procedure":[103],"both":[109],"primal":[110],"dual":[112],"problem":[117,134],"without":[118],"losing":[119],"max-determinant":[121],"property.":[122],"For":[123],"numerical":[124],"experiments,":[125],"QCQPs":[127],"from":[128],"lattice":[130],"graph":[131],"pooling":[133],"are":[135],"tested":[136],"as":[137,146,170],"their":[138],"relaxations":[140],"provide":[141],"same":[143,167],"optimal":[144],"value":[145,169],"relaxations.":[149],"We":[150],"demonstrate":[151],"improves":[157],"objective":[168],"thus":[174],"much":[175],"larger":[176],"be":[179],"handled":[180],"proposed":[183],"than":[186],"relaxation.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2019-11-22T00:00:00"}