{"id":"https://openalex.org/W2914793064","doi":"https://doi.org/10.1137/18m1185375","title":"Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines","display_name":"Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2914793064","doi":"https://doi.org/10.1137/18m1185375","mag":"2914793064"},"language":"en","primary_location":{"id":"doi:10.1137/18m1185375","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1185375","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028421252","display_name":"Mustafa \u00c7. P\u0131\u0306nar","orcid":"https://orcid.org/0000-0002-8307-187X"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Mustafa \u00c7 Pinar","raw_affiliation_strings":["\\dagger Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"\\dagger Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028421252"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.3783,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56364657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":"1","first_page":"194","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9955999851226807,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9933000206947327,"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/mathematics","display_name":"Mathematics","score":0.836442232131958},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6065569519996643},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5900407433509827},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5880322456359863},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.48430362343788147},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.48373010754585266},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4388939440250397},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4249642491340637},{"id":"https://openalex.org/keywords/basis-pursuit","display_name":"Basis pursuit","score":0.41219043731689453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33364206552505493},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.28944623470306396},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.25234249234199524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17206066846847534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07758137583732605}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.836442232131958},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6065569519996643},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5900407433509827},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5880322456359863},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.48430362343788147},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.48373010754585266},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4388939440250397},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4249642491340637},{"id":"https://openalex.org/C99217422","wikidata":"https://www.wikidata.org/wiki/Q4867576","display_name":"Basis pursuit","level":4,"score":0.41219043731689453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33364206552505493},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.28944623470306396},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.25234249234199524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17206066846847534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07758137583732605},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1185375","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1185375","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:repository.bilkent.edu.tr:11693/53208","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/53208","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1495421100","https://openalex.org/W1974499748","https://openalex.org/W1986931325","https://openalex.org/W2018503235","https://openalex.org/W2026073821","https://openalex.org/W2026653661","https://openalex.org/W2028372504","https://openalex.org/W2043202332","https://openalex.org/W2048245744","https://openalex.org/W2050834445","https://openalex.org/W2086183090","https://openalex.org/W2088095791","https://openalex.org/W2131448432","https://openalex.org/W2145096794","https://openalex.org/W2156364114","https://openalex.org/W2157969180","https://openalex.org/W2257998465","https://openalex.org/W2620850570","https://openalex.org/W3098520355"],"related_works":["https://openalex.org/W2355730523","https://openalex.org/W152021879","https://openalex.org/W2365629437","https://openalex.org/W2072918937","https://openalex.org/W2023935927","https://openalex.org/W2348330439","https://openalex.org/W2350372928","https://openalex.org/W2962941403","https://openalex.org/W2017698840","https://openalex.org/W2041507040"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,5,40,48],"exact":[3,55],"recovery":[4,56],"an":[6],"individual":[7],"sparse":[8],"vector":[9],"using":[10],"the":[11,31,34,38],"Basis":[12],"Pursuit":[13],"(BP)":[14],"model":[15],"is":[16,27,62,69],"considered.":[17],"A":[18],"differentiable":[19],"Huber":[20],"loss":[21],"function":[22],"(a":[23],"convex":[24],"quadratic":[25,46],"spline)":[26],"used":[28],"to":[29,58],"replace":[30],"$\\ell_1$-norm":[32],"in":[33],"BP":[35],"model.":[36],"Using":[37],"theory":[39],"duality":[41],"and":[42],"classical":[43],"results":[44],"from":[45],"perturbation":[47],"linear":[49],"programs,":[50],"a":[51,59],"necessary":[52],"condition":[53,68],"for":[54],"leading":[57],"negative":[60],"result":[61],"given.":[63],"An":[64],"easily":[65],"verifiable":[66],"sufficient":[67],"also":[70],"presented.":[71]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}