{"id":"https://openalex.org/W2752706835","doi":"https://doi.org/10.1137/17m114618x","title":"A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem","display_name":"A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2752706835","doi":"https://doi.org/10.1137/17m114618x","mag":"2752706835"},"language":"en","primary_location":{"id":"doi:10.1137/17m114618x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m114618x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/624868","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Paul Breiding","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Breiding","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Nick Vannieuwenhoven","orcid":"https://orcid.org/0000-0001-5692-4163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nick Vannieuwenhoven","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5692-4163","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1302,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.72131148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"3","first_page":"2435","last_page":"2465"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9528999924659729,"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"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9528999924659729,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.02449999935925007,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/tensor","display_name":"Tensor (intrinsic definition)","score":0.48969998955726624},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.4887000024318695},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.482699990272522},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.4239000082015991},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4138000011444092},{"id":"https://openalex.org/keywords/spurious-relationship","display_name":"Spurious relationship","score":0.40310001373291016},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39419999718666077},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39259999990463257},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3901999890804291}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8356999754905701},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.48969998955726624},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.4887000024318695},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.482699990272522},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4138000011444092},{"id":"https://openalex.org/C97256817","wikidata":"https://www.wikidata.org/wiki/Q1462316","display_name":"Spurious relationship","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39259999990463257},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C202887219","wikidata":"https://www.wikidata.org/wiki/Q3895221","display_name":"Parametrization (atmospheric modeling)","level":3,"score":0.36149999499320984},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3377000093460083},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.334199994802475},{"id":"https://openalex.org/C64835786","wikidata":"https://www.wikidata.org/wiki/Q17004583","display_name":"Cartesian tensor","level":5,"score":0.3287000060081482},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.314300000667572},{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.27459999918937683},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C20178491","wikidata":"https://www.wikidata.org/wiki/Q2204117","display_name":"Symmetric tensor","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/17m114618x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m114618x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/624868","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/624868","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Siam Journal On Optimization, vol. 28 (3), (2435-2465)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1709.00033","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.00033","pdf_url":"https://arxiv.org/pdf/1709.00033","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:lirias2repo.kuleuven.be:123456789/624868","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/624868","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Siam Journal On Optimization, vol. 28 (3), (2435-2465)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6473272509","display_name":null,"funder_award_id":"BU 1371/2-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W301566927","https://openalex.org/W1590929617","https://openalex.org/W1814521481","https://openalex.org/W1963826206","https://openalex.org/W1964650132","https://openalex.org/W1970935148","https://openalex.org/W1972547249","https://openalex.org/W1973246170","https://openalex.org/W1977252521","https://openalex.org/W1978632288","https://openalex.org/W1980906180","https://openalex.org/W1989811026","https://openalex.org/W1993642316","https://openalex.org/W2000215628","https://openalex.org/W2008972618","https://openalex.org/W2009941369","https://openalex.org/W2013912476","https://openalex.org/W2018014435","https://openalex.org/W2022242697","https://openalex.org/W2024165284","https://openalex.org/W2028324955","https://openalex.org/W2036133196","https://openalex.org/W2037181643","https://openalex.org/W2042901969","https://openalex.org/W2044777402","https://openalex.org/W2044901395","https://openalex.org/W2047680880","https://openalex.org/W2055913665","https://openalex.org/W2061169295","https://openalex.org/W2061959974","https://openalex.org/W2066392792","https://openalex.org/W2076214866","https://openalex.org/W2081962379","https://openalex.org/W2093736060","https://openalex.org/W2126381689","https://openalex.org/W2132267493","https://openalex.org/W2133512121","https://openalex.org/W2144070955","https://openalex.org/W2258054274","https://openalex.org/W2291029025","https://openalex.org/W2316966455","https://openalex.org/W2469230926","https://openalex.org/W2517205873","https://openalex.org/W2543667244","https://openalex.org/W2558791369","https://openalex.org/W2963282659","https://openalex.org/W2963354902","https://openalex.org/W2964015997","https://openalex.org/W4230644847"],"related_works":[],"abstract_inverted_index":{"The":[0,51],"canonical":[1,17],"tensor":[2,12,125],"rank":[3,126],"approximation":[4],"problem":[5],"(TAP)":[6],"consists":[7],"of":[8,15,53,68,144,149,153],"approximating":[9],"a":[10,21,33,39,76,88,109,132,159],"real-valued":[11],"by":[13],"one":[14],"low":[16],"rank,":[18],"which":[19],"is":[20,56,86,104,120],"challenging":[22],"nonlinear,":[23],"nonconvex,":[24],"constrained":[25],"optimization":[26,78,118],"problem,":[27,79],"where":[28],"the":[29,61,65,73,117,154],"constraint":[30,62],"set":[31,63],"forms":[32],"nonsmooth":[34],"semialgebraic":[35],"set.":[36],"We":[37],"introduce":[38,108],"Riemannian":[40,77],"Gauss--Newton":[41],"method":[42],"with":[43],"trust":[44],"region":[45],"for":[46],"solving":[47],"small-scale,":[48],"dense":[49],"TAPs.":[50],"novelty":[52],"our":[54],"approach":[55],"threefold.":[57],"First,":[58],"we":[59,81,107],"parametrize":[60],"as":[64,75],"Cartesian":[66],"product":[67],"Segre":[69],"manifolds,":[70],"hereby":[71],"formulating":[72],"TAP":[74],"and":[80,128],"argue":[82],"why":[83],"this":[84],"parametrization":[85],"theoretically":[87],"good":[89],"choice.":[90],"Second,":[91],"an":[92,123],"original":[93],"sequentially":[94],"truncated":[95],"higher-order":[96],"singular":[97],"value":[98],"decomposition":[99,127],"(ST-HOSVD)":[100],"based":[101],"retraction":[102],"operator":[103],"proposed.":[105],"Third,":[106],"hot":[110],"restart":[111],"mechanism":[112],"that":[113,129],"efficiently":[114],"detects":[115],"when":[116],"process":[119],"tending":[121],"to":[122,146,157],"ill-conditioned":[124],"often":[130],"yields":[131],"quick":[133],"escape":[134],"path":[135],"from":[136],"such":[137],"spurious":[138],"decompositions.":[139],"Numerical":[140],"experiments":[141],"show":[142],"improvements":[143],"up":[145],"three":[147],"orders":[148],"magnitude":[150],"in":[151],"terms":[152],"expected":[155],"time":[156],"compute":[158],"successful":[160],"solution":[161],"over":[162],"existing":[163],"state-of-the-art":[164],"methods.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-09-15T00:00:00"}
