{"id":"https://openalex.org/W2564972235","doi":"https://doi.org/10.1137/17m1115770","title":"Low-Rank Inducing Norms with Optimality Interpretations","display_name":"Low-Rank Inducing Norms with Optimality Interpretations","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2564972235","doi":"https://doi.org/10.1137/17m1115770","mag":"2564972235"},"language":"en","primary_location":{"id":"doi:10.1137/17m1115770","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1115770","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://arxiv.org/pdf/1612.03186","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christian Grussler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christian Grussler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Pontus Giselsson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pontus Giselsson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8893,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66537612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"4","first_page":"3057","last_page":"3078"},"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.8884000182151794,"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.8884000182151794,"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.08370000123977661,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.008799999952316284,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.7390000224113464},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5931000113487244},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.582099974155426},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5367000102996826},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47940000891685486},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46059998869895935},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45989999175071716}],"concepts":[{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.7390000224113464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7050999999046326},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5931000113487244},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.582099974155426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5564000010490417},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5367000102996826},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47940000891685486},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46059998869895935},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45989999175071716},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.45489999651908875},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3905999958515167},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.37290000915527344},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.2639999985694885}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/17m1115770","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1115770","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:arXiv.org:1612.03186","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1612.03186","pdf_url":"https://arxiv.org/pdf/1612.03186","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:lup.lub.lu.se:22510557-d19d-4cc6-96eb-76d539396894","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/22510557-d19d-4cc6-96eb-76d539396894","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1052-6234","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1612.03186","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1612.03186","pdf_url":"https://arxiv.org/pdf/1612.03186","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7852927557","display_name":null,"funder_award_id":"621-2012-5357","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1497701622","https://openalex.org/W2003753589","https://openalex.org/W2029213856","https://openalex.org/W2047071281","https://openalex.org/W2054121219","https://openalex.org/W2106525189","https://openalex.org/W2118550318","https://openalex.org/W2165694945","https://openalex.org/W2167077875","https://openalex.org/W2274254386","https://openalex.org/W2336294793","https://openalex.org/W2339027274","https://openalex.org/W2411338223","https://openalex.org/W2611328865","https://openalex.org/W4205213118"],"related_works":[],"abstract_inverted_index":{"Optimization":[0],"problems":[1,25,121,167],"with":[2,43,79],"rank":[3,20,75],"constraints":[4],"appear":[5],"in":[6,129],"many":[7],"diverse":[8],"fields":[9],"such":[10],"as":[11,64,149],"control,":[12],"machine":[13],"learning,":[14],"and":[15,57],"image":[16],"analysis.":[17],"Since":[18],"the":[19,37,61,87,90,102,120,131,136],"constraint":[21],"is":[22,36,106],"nonconvex,":[23],"these":[24,44,80,153],"are":[26,83,144],"often":[27],"approximately":[28],"solved":[29],"via":[30],"convex":[31,81,109],"relaxations.":[32],"Nuclear":[33],"norm":[34,63,104,138],"regularization":[35],"prevailing":[38],"convexifying":[39],"technique":[40],"for":[41],"dealing":[42],"types":[45],"of":[46,53,89,119,168],"problem.":[47],"This":[48],"paper":[49],"introduces":[50],"a":[51,65],"family":[52],"low-rank":[54,91,114,124,141],"inducing":[55,92,115,125,142],"norms":[56,93,126,143,154],"regularizers":[58],"which":[59,160],"include":[60],"nuclear":[62,103,137],"special":[66],"case.":[67],"A":[68],"posteriori":[69],"guarantees":[70],"on":[71,94,112],"solving":[72],"an":[73],"underlying":[74],"constrained":[76],"optimization":[77],"problem":[78],"relaxations":[82,110],"provided.":[84],"We":[85],"evaluate":[86],"performance":[88],"three":[95],"matrix":[96],"completion":[97],"problems.":[98],"In":[99],"all":[100],"examples,":[101],"heuristic":[105],"outperformed":[107],"by":[108],"based":[111],"other":[113],"norms.":[116],"For":[117],"two":[118],"there":[122],"exist":[123],"that":[127],"succeed":[128],"recovering":[130],"partially":[132],"unknown":[133],"matrix,":[134],"while":[135],"fails.":[139],"These":[140],"shown":[145],"to":[146,164],"be":[147],"representable":[148],"semidefinite":[150],"programs.":[151],"Moreover,":[152],"have":[155],"cheaply":[156],"computable":[157],"proximal":[158],"mappings,":[159],"make":[161],"it":[162],"possible":[163],"also":[165],"solve":[166],"large":[169],"size":[170],"using":[171],"first-order":[172],"methods.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2017-01-06T00:00:00"}