{"id":"https://openalex.org/W2794053546","doi":"https://doi.org/10.1080/10556788.2017.1415336","title":"FaRSA for \u2113<sub>1</sub>-regularized convex optimization: local convergence and numerical experience","display_name":"FaRSA for \u2113<sub>1</sub>-regularized convex optimization: local convergence and numerical experience","publication_year":2018,"publication_date":"2018-01-19","ids":{"openalex":"https://openalex.org/W2794053546","doi":"https://doi.org/10.1080/10556788.2017.1415336","mag":"2794053546"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1415336","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1415336","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5100783471","display_name":"Tianyi Chen","orcid":"https://orcid.org/0000-0002-5829-051X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tianyi Chen","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005028153","display_name":"Frank E. Curtis","orcid":"https://orcid.org/0000-0001-7214-9187"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frank E. Curtis","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082367556","display_name":"Daniel P. Robinson","orcid":"https://orcid.org/0000-0003-0251-4227"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel P. Robinson","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082367556"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":0.608,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.63422729,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"2","first_page":"396","last_page":"415"},"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.9993000030517578,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9926000237464905,"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/iterated-function","display_name":"Iterated function","score":0.6535601615905762},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5951506495475769},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5840909481048584},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5363133549690247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5178270936012268},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5144903659820557},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4763898253440857},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.46065661311149597},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4604078233242035},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4596535563468933},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43632155656814575},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.43539413809776306},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.43141716718673706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41940340399742126},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40807726979255676},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0816836953163147}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6535601615905762},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5951506495475769},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5840909481048584},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5363133549690247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5178270936012268},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5144903659820557},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4763898253440857},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.46065661311149597},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4604078233242035},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4596535563468933},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43632155656814575},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.43539413809776306},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.43141716718673706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41940340399742126},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40807726979255676},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0816836953163147},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2017.1415336","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1415336","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8173832379","display_name":null,"funder_award_id":"CCF-1618717","funder_id":"https://openalex.org/F4320338080","funder_display_name":"European Social Fund"},{"id":"https://openalex.org/G926940519","display_name":null,"funder_award_id":"DE-SC0010615","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W279731301","https://openalex.org/W2100556411","https://openalex.org/W2107501462","https://openalex.org/W2126607811","https://openalex.org/W2146842127","https://openalex.org/W2151898625","https://openalex.org/W2153635508","https://openalex.org/W2162870776","https://openalex.org/W2205688503","https://openalex.org/W2287259016","https://openalex.org/W2346238354","https://openalex.org/W2520766194","https://openalex.org/W2962748029","https://openalex.org/W2962929848"],"related_works":["https://openalex.org/W2029338229","https://openalex.org/W2100815210","https://openalex.org/W2363625234","https://openalex.org/W2018579258","https://openalex.org/W2921805297","https://openalex.org/W2356771840","https://openalex.org/W2131946988","https://openalex.org/W4232443521","https://openalex.org/W2036371636","https://openalex.org/W2087523368"],"abstract_inverted_index":{"FaRSA":[0],"is":[1,118],"a":[2,10,41,52,83,102,109,144,151,173],"new":[3],"method":[4,23,138],"for":[5],"minimizing":[6],"the":[7,22,90,94,113,121,126,137,168,179],"sum":[8],"of":[9,21,29,136,146,181],"differentiable":[11],"convex":[12],"function":[13,115],"and":[14,100,139],"an":[15,26,157],"-norm":[16],"regularizer.":[17],"The":[18],"main":[19],"features":[20],"include:":[24],"(i)":[25],"evolving":[27],"set":[28,123,145],"indices":[30],"corresponding":[31],"to":[32,37,48,55,79,165,192],"variables":[33,128],"that":[34,45,62,87,107,120,124,162,167],"are":[35],"predicted":[36],"be":[38,49,69,80,98,130],"nonzero":[39,127],"at":[40,172],"solution;":[42],"(ii)":[43],"subproblems":[44],"only":[46],"need":[47],"solved":[50],"in":[51,112],"reduced":[53,103],"space":[54],"lessen":[56],"per-iteration":[57],"computational":[58],"costs;":[59],"(iii)":[60],"conditions":[61],"determine":[63],"how":[64],"accurately":[65],"each":[66],"subproblem":[67,96,159],"must":[68],"solved,":[70],"which":[71],"allow":[72],"conjugate":[73],"gradient":[74,105],"or":[75],"coordinate":[76],"descent":[77],"techniques":[78],"employed;":[81],"(iv)":[82],"computationally":[84],"practical":[85],"condition":[86,161],"dictates":[88],"when":[89,116],"subspace":[91],"explored":[92],"by":[93],"current":[95],"should":[97,129],"updated;":[99],"(v)":[101],"proximal":[104],"step":[106],"ensures":[108],"sufficient":[110],"decrease":[111],"objective":[114],"it":[117],"decided":[119],"index":[122],"holds":[125],"expanded.":[131],"We":[132],"proved":[133],"global":[134],"convergence":[135],"demonstrated":[140],"its":[141],"performance":[142],"on":[143],"model":[147],"prediction":[148],"problems":[149],"with":[150,188],"Matlab":[152],"implementation.":[153],"Here,":[154],"we":[155,177],"introduce":[156],"enhanced":[158],"termination":[160],"allows":[163],"us":[164],"prove":[166],"iterates":[169],"converge":[170],"locally":[171],"superlinear":[174],"rate.":[175],"Moreover,":[176],"present":[178],"details":[180],"our":[182],"publicly":[183],"available":[184],"C":[185],"implementation":[186],"along":[187],"extensive":[189],"numerical":[190],"comparisons":[191],"other":[193],"state-of-the-art":[194],"solvers.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
