{"id":"https://openalex.org/W2914084334","doi":"https://doi.org/10.1007/s10589-021-00270-x","title":"A Laplacian approach to $$\\ell _1$$-norm minimization","display_name":"A Laplacian approach to $$\\ell _1$$-norm minimization","publication_year":2021,"publication_date":"2021-03-19","ids":{"openalex":"https://openalex.org/W2914084334","doi":"https://doi.org/10.1007/s10589-021-00270-x","mag":"2914084334"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-021-00270-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-021-00270-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-021-00270-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-021-00270-x.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Vincenzo Bonifaci","orcid":"https://orcid.org/0000-0001-9038-6901"},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Vincenzo Bonifaci","raw_affiliation_strings":["Dipartimento di Matematica e Fisica, Universit\u00e0 degli Studi Roma Tre, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0001-9038-6901","affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Fisica, Universit\u00e0 degli Studi Roma Tre, Rome, Italy","institution_ids":["https://openalex.org/I119003972"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I119003972"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.6514,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69134717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"79","issue":"2","first_page":"441","last_page":"469"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.21160000562667847,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.21160000562667847,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.20329999923706055,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.15729999542236328,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5529999732971191},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5475000143051147},{"id":"https://openalex.org/keywords/iteratively-reweighted-least-squares","display_name":"Iteratively reweighted least squares","score":0.5217000246047974},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5160999894142151},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4966000020503998},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.4212000072002411},{"id":"https://openalex.org/keywords/basis-function","display_name":"Basis function","score":0.41769999265670776},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4034000039100647},{"id":"https://openalex.org/keywords/basis-pursuit","display_name":"Basis pursuit","score":0.38280001282691956}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8555999994277954},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5529999732971191},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5475000143051147},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.5217000246047974},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5160999894142151},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4966000020503998},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.438400000333786},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C5917680","wikidata":"https://www.wikidata.org/wiki/Q2621825","display_name":"Basis function","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.41600000858306885},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C99217422","wikidata":"https://www.wikidata.org/wiki/Q4867576","display_name":"Basis pursuit","level":4,"score":0.38280001282691956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34940001368522644},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.3458000123500824},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.3402999937534332},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.2964000105857849},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10589-021-00270-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-021-00270-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-021-00270-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1901.08836","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.08836","pdf_url":"https://arxiv.org/pdf/1901.08836","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:RePEc:spr:coopap:v:79:y:2021:i:2:d:10.1007_s10589-021-00270-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-021-00270-x","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:iris.uniroma3.it:11590/385257","is_oa":true,"landing_page_url":"http://hdl.handle.net/11590/385257","pdf_url":null,"source":{"id":"https://openalex.org/S4377196120","display_name":"Iris (Roma Tre University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119003972","host_organization_name":"Roma Tre University","host_organization_lineage":["https://openalex.org/I119003972"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10589-021-00270-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-021-00270-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-021-00270-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310926","display_name":"Universit\u00e0 degli Studi Roma Tre","ror":"https://ror.org/05vf0dg29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2914084334.pdf","grobid_xml":"https://content.openalex.org/works/W2914084334.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W143004564","https://openalex.org/W1968307589","https://openalex.org/W1984553293","https://openalex.org/W1987717935","https://openalex.org/W1996287810","https://openalex.org/W2003810228","https://openalex.org/W2016384870","https://openalex.org/W2050834445","https://openalex.org/W2055954415","https://openalex.org/W2078204800","https://openalex.org/W2085728653","https://openalex.org/W2087714402","https://openalex.org/W2105760337","https://openalex.org/W2119883478","https://openalex.org/W2150865801","https://openalex.org/W2153441719","https://openalex.org/W2167732364","https://openalex.org/W2168745297","https://openalex.org/W2535496140","https://openalex.org/W2551153860","https://openalex.org/W2679590114","https://openalex.org/W2737241248","https://openalex.org/W2763081248","https://openalex.org/W2903718010","https://openalex.org/W2923167415","https://openalex.org/W2946265133","https://openalex.org/W2962941403","https://openalex.org/W2963689635","https://openalex.org/W2993403400","https://openalex.org/W4205213118","https://openalex.org/W4237496336","https://openalex.org/W4238591275","https://openalex.org/W4244732212","https://openalex.org/W4247828191"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,53],"propose":[2],"a":[3,37,59,68],"novel":[4],"differentiable":[5],"reformulation":[6,24],"of":[7,31,40,46,58,79,94,102],"the":[8,19,28,44,55,64,76,92],"linearly-constrained":[9],"$$\\ell":[10,47],"_1$$":[11,48],"<mml:math":[12,49],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:msub><mml:mi>\u2113</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>":[13,50],"minimization":[14,51],"problem,":[15],"also":[16],"known":[17],"as":[18,73,75,89],"basis":[20,103],"pursuit":[21],"problem.":[22],"The":[23,84],"is":[25],"inspired":[26],"by":[27],"Laplacian":[29],"paradigm":[30],"network":[32],"theory":[33],"and":[34],"leads":[35],"to":[36,63],"new":[38],"family":[39],"gradient-based":[41],"methods":[42,101],"for":[43],"solution":[45,61],"problems.":[52],"analyze":[54],"iteration":[56,77],"complexity":[57,78,93],"natural":[60],"approach":[62],"reformulation,":[65],"based":[66],"on":[67,91],"multiplicative":[69],"weights":[70],"update":[71],"scheme,":[72],"well":[74],"an":[80],"accelerated":[81],"gradient":[82],"scheme.":[83],"results":[85],"can":[86],"be":[87],"seen":[88],"bounds":[90],"iteratively":[95],"reweighted":[96],"least":[97],"squares":[98],"(IRLS)":[99],"type":[100],"pursuit.":[104]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2019-02-21T00:00:00"}