{"id":"https://openalex.org/W2126138717","doi":"https://doi.org/10.1007/s10589-013-9594-z","title":"On the computational complexity of membership problems for the completely positive cone and its dual","display_name":"On the computational complexity of membership problems for the completely positive cone and its dual","publication_year":2013,"publication_date":"2013-09-11","ids":{"openalex":"https://openalex.org/W2126138717","doi":"https://doi.org/10.1007/s10589-013-9594-z","mag":"2126138717"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-013-9594-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9594-z","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5022759229","display_name":"Peter J. C. Dickinson","orcid":"https://orcid.org/0000-0001-9274-9622"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Peter J. C. Dickinson","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Vienna, Oskar-Morgenstern-Platz 1, 1090, Wien, Austria","Department of Statistics and Operations Research, University of Vienna, Wien, Austria 1090#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Vienna, Oskar-Morgenstern-Platz 1, 1090, Wien, Austria","institution_ids":["https://openalex.org/I129774422"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Vienna, Wien, Austria 1090#TAB#","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032239649","display_name":"Luuk Gijben","orcid":null},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Luuk Gijben","raw_affiliation_strings":["Johann Bernoulli Institute, University of Groningen, P.O. Box 407, 9700 AK, Groningen, The Netherlands","Johann Bernoulli Institute, University of Groningen, Groningen, The Netherlands 9700 AK#TAB#"],"affiliations":[{"raw_affiliation_string":"Johann Bernoulli Institute, University of Groningen, P.O. Box 407, 9700 AK, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]},{"raw_affiliation_string":"Johann Bernoulli Institute, University of Groningen, Groningen, The Netherlands 9700 AK#TAB#","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022759229"],"corresponding_institution_ids":["https://openalex.org/I129774422"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":20.7137,"has_fulltext":false,"cited_by_count":163,"citation_normalized_percentile":{"value":0.99610883,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"57","issue":"2","first_page":"403","last_page":"415"},"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.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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.9991999864578247,"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/cone","display_name":"Cone (formal languages)","score":0.884535014629364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8047509789466858},{"id":"https://openalex.org/keywords/dual-cone-and-polar-cone","display_name":"Dual cone and polar cone","score":0.5698968172073364},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.5374335646629333},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.47554609179496765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44987407326698303},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44679901003837585},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3761107623577118},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19072329998016357},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14199551939964294},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1142168641090393},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.055749744176864624}],"concepts":[{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.884535014629364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8047509789466858},{"id":"https://openalex.org/C24484764","wikidata":"https://www.wikidata.org/wiki/Q2687694","display_name":"Dual cone and polar cone","level":3,"score":0.5698968172073364},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.5374335646629333},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.47554609179496765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44987407326698303},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44679901003837585},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3761107623577118},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19072329998016357},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14199551939964294},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1142168641090393},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.055749744176864624},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10589-013-9594-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9594-z","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/21ba3d7e-ae5f-4757-ba4d-891584bdcce1","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/21ba3d7e-ae5f-4757-ba4d-891584bdcce1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Dickinson, P J C & Gijben, L 2014, 'On the computational complexity of membership problems for the completely positive cone and its dual', Computational optimization and applications, vol. 57, no. 2, pp. 403-415. https://doi.org/10.1007/s10589-013-9594-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:coopap:v:57:y:2014:i:2:p:403-415","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10589-013-9594-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:ris.utwente.nl:publications/21ba3d7e-ae5f-4757-ba4d-891584bdcce1","is_oa":false,"landing_page_url":"http://eprints.eemcs.utwente.nl/secure2/25333/01/Dickinson_and_Gijben_-_2014_-_On_the_computational_complexity_of_membership_prob.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dickinson , P J C & Gijben , L 2014 , ' On the computational complexity of membership problems for the completely positive cone and its dual ' , Computational optimization and applications , vol. 57 , no. 2 , pp. 403-415 . https://doi.org/10.1007/s10589-013-9594-z","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W598314002","https://openalex.org/W1484040084","https://openalex.org/W1788938005","https://openalex.org/W1985534144","https://openalex.org/W1991347066","https://openalex.org/W2011039300","https://openalex.org/W2012956404","https://openalex.org/W2018776261","https://openalex.org/W2025776604","https://openalex.org/W2026856626","https://openalex.org/W2043470680","https://openalex.org/W2078600458","https://openalex.org/W2079135578","https://openalex.org/W2097900174","https://openalex.org/W2100440346","https://openalex.org/W2114467398","https://openalex.org/W2120146316","https://openalex.org/W2124487034","https://openalex.org/W2144560699","https://openalex.org/W2504734010","https://openalex.org/W2988480584","https://openalex.org/W4248179398","https://openalex.org/W4285719527","https://openalex.org/W4302087481"],"related_works":["https://openalex.org/W2550463706","https://openalex.org/W2182497102","https://openalex.org/W2952895455","https://openalex.org/W2100036510","https://openalex.org/W2956921597","https://openalex.org/W2518235024","https://openalex.org/W2228685688","https://openalex.org/W1965358437","https://openalex.org/W3045946120","https://openalex.org/W2257291892"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2025-10-10T00:00:00"}