{"id":"https://openalex.org/W3107535351","doi":"https://doi.org/10.1080/10556788.2021.2022146","title":"Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software","display_name":"Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software","publication_year":2022,"publication_date":"2022-02-14","ids":{"openalex":"https://openalex.org/W3107535351","doi":"https://doi.org/10.1080/10556788.2021.2022146","mag":"3107535351"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2021.2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2021.2022146","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2021.2022146?needAccess=true","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":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2021.2022146?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070409272","display_name":"Daniel Brosch","orcid":"https://orcid.org/0000-0003-3988-4336"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Daniel Brosch","raw_affiliation_strings":["Tilburg University","Department of Econometrics and Operations Research, Tilburg University, Tilburg, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3988-4336","affiliations":[{"raw_affiliation_string":"Tilburg University","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, Tilburg, Netherlands","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019341464","display_name":"Etienne de Klerk","orcid":"https://orcid.org/0000-0003-3377-0063"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Etienne de Klerk","raw_affiliation_strings":["Tilburg University","Department of Econometrics and Operations Research, Tilburg University, Tilburg, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3377-0063","affiliations":[{"raw_affiliation_string":"Tilburg University","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, Tilburg, Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070409272"],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":null,"apc_paid":null,"fwci":1.4641,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75917241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"37","issue":"6","first_page":"1987","last_page":"2006"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9932000041007996,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.7635893225669861},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.7366748452186584},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6331650614738464},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.6202687621116638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6144586205482483},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.6144272089004517},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5968645811080933},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5207995176315308},{"id":"https://openalex.org/keywords/symmetry","display_name":"Symmetry (geometry)","score":0.515184760093689},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46273717284202576},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.44673702120780945},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4245948791503906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42228570580482483},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25544193387031555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.241922527551651},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1058172881603241},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.08998262882232666},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.08603918552398682}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7635893225669861},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.7366748452186584},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6331650614738464},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.6202687621116638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6144586205482483},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.6144272089004517},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5968645811080933},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5207995176315308},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.515184760093689},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46273717284202576},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.44673702120780945},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4245948791503906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42228570580482483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25544193387031555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.241922527551651},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1058172881603241},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.08998262882232666},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.08603918552398682},{"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/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/10556788.2021.2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2021.2022146","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2021.2022146?needAccess=true","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:tilburguniversity.edu:openaire/283da78a-b42f-47b4-b2b7-260355dd7b3c","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/283da78a-b42f-47b4-b2b7-260355dd7b3c","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brosch, D & de Klerk, E 2022, 'Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software', Optimization Methods & Software, vol. 37, no. 6, pp. 2001-2020. https://doi.org/10.1080/10556788.2021.2022146","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:2001.11348","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2001.11348","pdf_url":"https://arxiv.org/pdf/2001.11348","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},{"id":"pmh:oai:tilburguniversity.edu:publications/283da78a-b42f-47b4-b2b7-260355dd7b3c","is_oa":true,"landing_page_url":"https://www.tandfonline.com/doi/full/10.1080/10556788.2021.2022146","pdf_url":"https://pure.uvt.nl/ws/files/57116091/Jordan_reduction_Paper_revised_V3_no_color.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brosch, D & de Klerk, E 2022, 'Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: Theory and software', Optimization Methods & Software, vol. 37, no. 6, pp. 2001-2020. https://doi.org/10.1080/10556788.2021.2022146","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1080/10556788.2021.2022146","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2021.2022146","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2021.2022146?needAccess=true","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1041234596","display_name":"Mixed-Integer Non-Linear Optimisation Applications","funder_award_id":"764759","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6446765011","display_name":"Mixed-Integer Non-Linear Optimisation Applications","funder_award_id":"764759","funder_id":"https://openalex.org/F4320338337","funder_display_name":"H2020 Marie Sk\u0142odowska-Curie Actions"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338337","display_name":"H2020 Marie Sk\u0142odowska-Curie Actions","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3107535351.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W10800830","https://openalex.org/W615699635","https://openalex.org/W651323857","https://openalex.org/W1503085769","https://openalex.org/W1595903022","https://openalex.org/W1986323939","https://openalex.org/W1987255230","https://openalex.org/W2019855902","https://openalex.org/W2038854434","https://openalex.org/W2085991972","https://openalex.org/W2109156232","https://openalex.org/W2114189119","https://openalex.org/W2146060931","https://openalex.org/W2146586176","https://openalex.org/W2151283714","https://openalex.org/W2188609405","https://openalex.org/W2494852246","https://openalex.org/W2524488792","https://openalex.org/W2794029565","https://openalex.org/W2886614587","https://openalex.org/W2949537651","https://openalex.org/W3104420602","https://openalex.org/W3104971636","https://openalex.org/W3107263050","https://openalex.org/W3111898596"],"related_works":["https://openalex.org/W3199026565","https://openalex.org/W4323321439","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W4293777484","https://openalex.org/W2588229150","https://openalex.org/W2031269429","https://openalex.org/W2047688435","https://openalex.org/W3174981835"],"abstract_inverted_index":{"A":[0],"common":[1],"computational":[2],"approach":[3],"for":[4,32,36,62,68],"polynomial":[5],"optimization":[6,34,48],"problems":[7,39,49],"(POPs)":[8],"is":[9,29,114],"to":[10,26,83,92],"use":[11],"(hierarchies":[12],"of)":[13],"semidefinite":[14],"programming":[15],"(SDP)":[16],"relaxations.":[17],"When":[18],"the":[19,22,30,51,84,96,111],"variables":[20],"in":[21],"POP":[23],"are":[24,46],"required":[25],"be":[27],"nonnegative\u2013as":[28],"case":[31],"combinatorial":[33],"problems,":[35],"example\u2013these":[37],"SDP":[38],"typically":[40],"involve":[41],"nonnegative":[42,53,86],"matrices,":[43],"i.e.":[44],"they":[45],"conic":[47,63],"over":[50],"doubly":[52,85],"cone.":[54],"The":[55],"Jordan":[56],"reduction,":[57],"a":[58],"symmetry":[59,112],"reduction":[60,113],"method":[61,82],"optimization,":[64],"was":[65],"recently":[66],"introduced":[67],"symmetric":[69],"cones":[70],"by":[71],"Parrilo":[72],"and":[73,88,99],"Permenter":[74],"[Mathematical":[75],"Programming":[76],"181(1),":[77],"2020].":[78],"We":[79,104],"extend":[80],"this":[81],"cone,":[87],"investigate":[89],"its":[90],"application":[91],"known":[93],"relaxations":[94],"of":[95],"quadratic":[97],"assignment":[98],"maximum":[100],"stable":[101],"set":[102],"problems.":[103],"also":[105],"introduce":[106],"new":[107],"Julia":[108],"software":[109],"where":[110],"implemented.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}