{"id":"https://openalex.org/W4386960103","doi":"https://doi.org/10.1137/22m1518256","title":"An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration","display_name":"An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration","publication_year":2023,"publication_date":"2023-09-22","ids":{"openalex":"https://openalex.org/W4386960103","doi":"https://doi.org/10.1137/22m1518256"},"language":"en","primary_location":{"id":"doi:10.1137/22m1518256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1518256","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/278401","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016809468","display_name":"Guillaume Olikier","orcid":"https://orcid.org/0000-0002-2767-0480"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Guillaume Olikier","raw_affiliation_strings":["ICTEAM Institute, UCLouvain, Avenue Georges Lema\u00eetre 4, 1348 Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"ICTEAM Institute, UCLouvain, Avenue Georges Lema\u00eetre 4, 1348 Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075495386","display_name":"Pierre-Antoine Absil","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"P.-A. Absil","raw_affiliation_strings":["ICTEAM Institute, UCLouvain, Avenue Georges Lema\u00eetre 4, 1348 Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"ICTEAM Institute, UCLouvain, Avenue Georges Lema\u00eetre 4, 1348 Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016809468"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":1.2992,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76438745,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"44","issue":"3","first_page":"1421","last_page":"1435"},"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.9994999766349792,"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.9994999766349792,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9987000226974487,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9983999729156494,"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/rank","display_name":"Rank (graph theory)","score":0.801433801651001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7719402313232422},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6882842779159546},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6314966678619385},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5904358625411987},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.5463850498199463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5371381044387817},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.4865766763687134},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.45142805576324463},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4406232237815857},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42928358912467957},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42744970321655273},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41463565826416016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37770968675613403},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.33459603786468506},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13150885701179504}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.801433801651001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7719402313232422},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6882842779159546},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6314966678619385},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5904358625411987},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.5463850498199463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5371381044387817},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.4865766763687134},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.45142805576324463},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4406232237815857},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42928358912467957},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42744970321655273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41463565826416016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37770968675613403},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33459603786468506},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13150885701179504},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/22m1518256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1518256","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:dial.uclouvain.be:boreal:278401","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/278401","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"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":"SIAM Journal on Matrix Analysis and Applications, Vol. 44, no.3, p. 1421-1435 (2023)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:278401","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/278401","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"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":"SIAM Journal on Matrix Analysis and Applications, Vol. 44, no.3, p. 1421-1435 (2023)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2787453302","display_name":null,"funder_award_id":"30468160","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1993468393","https://openalex.org/W2162171343","https://openalex.org/W2901838001","https://openalex.org/W3092363548","https://openalex.org/W3181949156","https://openalex.org/W4244593923","https://openalex.org/W4249513058","https://openalex.org/W4312258136"],"related_works":["https://openalex.org/W4286857066","https://openalex.org/W4238239967","https://openalex.org/W1677518548","https://openalex.org/W3213958552","https://openalex.org/W2949926331","https://openalex.org/W2754545762","https://openalex.org/W4297812081","https://openalex.org/W4299562540","https://openalex.org/W4298208753","https://openalex.org/W3175273680"],"abstract_inverted_index":{"We":[0,58],"consider":[1],"the":[2,15,49,68,80,91,110,113,134,137,140],"problem":[3],"of":[4,29,36,66,71,95,112,128,136],"minimizing":[5],"a":[6,21,37,64,126],"differentiable":[7],"function":[8],"with":[9,109],"locally":[10],"Lipschitz":[11],"continuous":[12],"gradient":[13],"over":[14],"real":[16],"determinantal":[17],"variety,":[18],"and":[19,44,75,87,120],"present":[20],"first-order":[22],"algorithm":[23,33,62,97,115],"designed":[24],"to":[25,54,133],"find":[26],"stationary":[27],"points":[28,70],"that":[30,60],"problem.":[31],"This":[32],"applies":[34],"steps":[35],"retraction-free":[38],"descent":[39],"method":[40],"proposed":[41],"by":[42,84,117],"Schneider":[43],"Uschmajew":[45],"(2015),":[46],"while":[47],"taking":[48],"numerical":[50],"rank":[51,56,92,102,129,135],"into":[52],"account":[53],"attempt":[55,104],"reductions.":[57],"prove":[59],"this":[61,96],"produces":[63],"sequence":[65],"iterates":[67],"accumulation":[69],"which":[72,123],"are":[73],"stationary,":[74],"therefore":[76],"does":[77],"not":[78],"follow":[79],"so-called":[81],"apocalypses":[82],"described":[83],"Levin,":[85],"Kileel,":[86],"Boumal":[88],"(2022).":[89],"Moreover,":[90],"reduction":[93,103,130],"mechanism":[94],"requires":[98],"at":[99],"most":[100],"one":[101,111],"per":[105],"iteration,":[106],"in":[107,139],"contrast":[108],"P2GDR":[114],"introduced":[116],"Olikier,":[118],"Gallivan,":[119],"Absil":[121],"(2022)":[122],"can":[124],"require":[125],"number":[127],"attempts":[131],"equal":[132],"iterate":[138],"worst-case":[141],"scenario.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2023-09-23T00:00:00"}