{"id":"https://openalex.org/W2986599608","doi":"https://doi.org/10.23919/eusipco.2019.8902569","title":"A parallel sparse regularization method for structured multilinear low-rank tensor decomposition","display_name":"A parallel sparse regularization method for structured multilinear low-rank tensor decomposition","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2986599608","doi":"https://doi.org/10.23919/eusipco.2019.8902569","mag":"2986599608"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco.2019.8902569","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2019.8902569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 27th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-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/A5085552067","display_name":"Gerta Kushe","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gerta Kushe","raw_affiliation_strings":["Communication Systems Group, Technische Universit\u00e4t Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Technische Universit\u00e4t Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100733872","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0003-2817-3686"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Yang Yang","raw_affiliation_strings":["Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102901093","display_name":"Christian Steffens","orcid":"https://orcid.org/0000-0002-0990-0967"},"institutions":[{"id":"https://openalex.org/I4210156661","display_name":"Teles (Germany)","ror":"https://ror.org/04xmxqq10","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210156661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Steffens","raw_affiliation_strings":["Telespazio-VEGA Deutschland, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Telespazio-VEGA Deutschland, Darmstadt, Germany","institution_ids":["https://openalex.org/I4210156661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001481378","display_name":"Marius Pesavento","orcid":"https://orcid.org/0000-0003-3395-2588"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marius Pesavento","raw_affiliation_strings":["Communication Systems Group, Technische Universit\u00e4t Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Technische Universit\u00e4t Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5085552067"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61186635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/multilinear-map","display_name":"Multilinear map","score":0.9263843297958374},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.6211376786231995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6038227677345276},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.583730161190033},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5469328761100769},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5292797684669495},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5091060996055603},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.49897146224975586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4946095645427704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4596080780029297},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.43626973032951355},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.43331512808799744},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4100683629512787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4049743413925171},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.38125669956207275},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16118556261062622},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06767880916595459}],"concepts":[{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.9263843297958374},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.6211376786231995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6038227677345276},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.583730161190033},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5469328761100769},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5292797684669495},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5091060996055603},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.49897146224975586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4946095645427704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4596080780029297},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.43626973032951355},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.43331512808799744},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4100683629512787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4049743413925171},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38125669956207275},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16118556261062622},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06767880916595459},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/eusipco.2019.8902569","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2019.8902569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 27th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:113774","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:118683","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/118683/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W974511872","https://openalex.org/W1540764732","https://openalex.org/W1559820134","https://openalex.org/W1965420425","https://openalex.org/W1966096622","https://openalex.org/W2009291374","https://openalex.org/W2018778093","https://openalex.org/W2019473268","https://openalex.org/W2020255126","https://openalex.org/W2024165284","https://openalex.org/W2089088256","https://openalex.org/W2103519107","https://openalex.org/W2109522725","https://openalex.org/W2123457453","https://openalex.org/W2140862024","https://openalex.org/W2143075842","https://openalex.org/W2153023338","https://openalex.org/W2157326466","https://openalex.org/W2168837636","https://openalex.org/W2559255867","https://openalex.org/W2620692277","https://openalex.org/W2633610211","https://openalex.org/W2781773153","https://openalex.org/W2793425295","https://openalex.org/W2962727817","https://openalex.org/W2963124734","https://openalex.org/W2964076350","https://openalex.org/W6633365869"],"related_works":["https://openalex.org/W193289519","https://openalex.org/W2806639836","https://openalex.org/W3189506985","https://openalex.org/W4386780987","https://openalex.org/W2239312496","https://openalex.org/W3213449325","https://openalex.org/W123932431","https://openalex.org/W2897430141","https://openalex.org/W2091381096","https://openalex.org/W4226369201"],"abstract_inverted_index":{"In":[0],"this":[1,48],"paper":[2],"we":[3],"consider":[4],"the":[5,23,63,73,89,95,104,111],"structured":[6],"multilinear":[7],"low-rank":[8],"tensor":[9,107],"decomposition":[10,108],"problem":[11,53,61],"where":[12],"group":[13],"sparsity":[14],"is":[15],"enforced":[16],"using":[17],"nuclear":[18],"norm":[19],"regularization.":[20],"We":[21,93],"adopt":[22],"recently":[24],"proposed":[25,79,105],"sequential":[26],"convex":[27],"approximation":[28],"approach":[29],"to":[30],"develop":[31],"an":[32],"optimization":[33,45,52,76],"algorithm":[34,46,80],"suitable":[35],"for":[36,47,110],"implementation":[37],"on":[38,55,88],"modern":[39],"parallel":[40],"hardware":[41],"architectures.":[42],"An":[43],"existing":[44],"non-convex":[49],"and":[50,85],"non-differentable":[51],"relies":[54],"a":[56],"lifting":[57,64,84],"approach.":[58],"For":[59],"large":[60],"dimensions":[62],"procedure":[65],"is,":[66],"however,":[67],"inefficient":[68],"as":[69],"it":[70],"drastically":[71],"increases":[72],"number":[74],"of":[75,100,103,113],"variables.":[77],"Our":[78],"does":[81],"not":[82],"require":[83],"directly":[86],"operates":[87],"original":[90],"parameters":[91],"space.":[92],"demonstrate":[94],"performance":[96],"gains":[97],"in":[98],"terms":[99],"convergence":[101],"speed":[102],"sparse":[106],"method":[109],"example":[112],"two":[114],"dimensional":[115],"harmonic":[116],"retrieval.":[117]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}