{"id":"https://openalex.org/W2215520601","doi":"https://doi.org/10.1080/10556788.2015.1088851","title":"A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization","display_name":"A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization","publication_year":2015,"publication_date":"2015-11-13","ids":{"openalex":"https://openalex.org/W2215520601","doi":"https://doi.org/10.1080/10556788.2015.1088851","mag":"2215520601"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1088851","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1088851","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/A5030444750","display_name":"Yoon Mo Jung","orcid":"https://orcid.org/0000-0003-4276-372X"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Y.M. Jung","raw_affiliation_strings":["Department of Computational Science and Engineering, Yonsei University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computational Science and Engineering, Yonsei University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007999423","display_name":"Sangwoon Yun","orcid":"https://orcid.org/0000-0002-5782-7266"},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"S. Yun","raw_affiliation_strings":["Department of Mathematics Education, Sungkyunkwan University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics Education, Sungkyunkwan University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I848706"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007999423"],"corresponding_institution_ids":["https://openalex.org/I848706"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09003146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"2","first_page":"342","last_page":"358"},"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/T11205","display_name":"Numerical methods in inverse problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.979200005531311,"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/mathematics","display_name":"Mathematics","score":0.6718943119049072},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.6718795895576477},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.5520452260971069},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5019052028656006},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4945378005504608},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.48979759216308594},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4845966100692749},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4749027490615845},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47364556789398193},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4702678620815277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4014613926410675}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6718943119049072},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.6718795895576477},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.5520452260971069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5019052028656006},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4945378005504608},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.48979759216308594},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4845966100692749},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4749027490615845},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47364556789398193},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4702678620815277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4014613926410675},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2015.1088851","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1088851","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1965129938","https://openalex.org/W1982941867","https://openalex.org/W1986931325","https://openalex.org/W1996287810","https://openalex.org/W2005082281","https://openalex.org/W2009702064","https://openalex.org/W2039050532","https://openalex.org/W2057624533","https://openalex.org/W2062102668","https://openalex.org/W2063978378","https://openalex.org/W2072265605","https://openalex.org/W2076605490","https://openalex.org/W2091494211","https://openalex.org/W2098012923","https://openalex.org/W2103559027","https://openalex.org/W2109449402","https://openalex.org/W2117669906","https://openalex.org/W2126607811","https://openalex.org/W2129638195","https://openalex.org/W2145096794","https://openalex.org/W2160396672","https://openalex.org/W2170929819","https://openalex.org/W2296616510","https://openalex.org/W3022380717","https://openalex.org/W4249513058","https://openalex.org/W4249667877","https://openalex.org/W4250955649","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2158224665","https://openalex.org/W2379589510","https://openalex.org/W2117229703","https://openalex.org/W2810730439","https://openalex.org/W4300044672","https://openalex.org/W1881631164","https://openalex.org/W2358292267","https://openalex.org/W2395088808","https://openalex.org/W2053179534","https://openalex.org/W4384575246"],"abstract_inverted_index":{"A":[0,61],"problem":[1,52,69],"in":[2],"optimization,":[3],"with":[4,18,114,132],"a":[5,12,15,34,40,89],"wide":[6],"range":[7],"of":[8,14,91],"applications,":[9],"entails":[10],"finding":[11],"solution":[13],"linear":[16,82,101],"equation":[17],"various":[19],"minimization":[20,51,182],"properties.":[21],"Such":[22],"applications":[23,133],"include":[24],"compressed":[25,135,161],"sensing,":[26,136,162],"which":[27,86],"requires":[28],"an":[29,178],"efficient":[30,179],"method":[31,44,75,173,180],"to":[32,45,78,134],"find":[33],"minimal":[35],"norm":[36],"solution.":[37],"We":[38,103],"propose":[39],"coordinate":[41,73],"descent":[42,74],"homotopy":[43],"solve":[46,79],"the":[47,66,80,94,171],"linearly":[48],"constrained":[49],"convex":[50,57],"where":[53],"P":[54],"is":[55,65,76],"proper,":[56],"and":[58,97,124,145,154],"lower":[59],"semicontinuous.":[60],"well-known":[62],"special":[63],"case":[64],"basis":[67,110],"pursuit":[68,111],".":[70],"The":[71],"greedy-type":[72],"applied":[77],"regularized":[81],"least":[83],"squares":[84],"problem,":[85],"arises":[87],"as":[88,177],"sequence":[90],"subproblems":[92],"for":[93,107,130,160,181],"proposed":[95,172],"method,":[96],"we":[98],"show":[99],"global":[100],"convergence.":[102],"report":[104],"numerical":[105],"results":[106],"solving":[108],"large-scale":[109],"problem.":[112,183],"Comparison":[113],"Bregman":[115,127,147,158],"iterative":[116,128,148],"algorithm":[117,149],"[W.":[118],"Yin,":[119],"S.":[120,152],"Osher,":[121,153],"D.":[122],"Goldfarb,":[123],"J.":[125,138],"Darbon,":[126],"algorithms":[129],"-minimization":[131],"SIAM":[137],"Image":[139],"Sci.":[140],"1":[141],"(2008),":[142],"pp.":[143,167],"143\u2013168]":[144],"linearized":[146],"[J.-F.":[150],"Cai,":[151],"Z.":[155],"Shen,":[156],"Linearized":[157],"iterations":[159],"Math.":[163],"Comput.":[164],"78":[165],"(2009),":[166],"1515\u20131536]":[168],"suggests":[169],"that":[170],"can":[174],"be":[175],"used":[176]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}