{"id":"https://openalex.org/W2163232332","doi":"https://doi.org/10.1137/140998135","title":"Global Convergence of Splitting Methods for Nonconvex Composite Optimization","display_name":"Global Convergence of Splitting Methods for Nonconvex Composite Optimization","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2163232332","doi":"https://doi.org/10.1137/140998135","mag":"2163232332"},"language":"en","primary_location":{"id":"doi:10.1137/140998135","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140998135","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/1407.0753","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Guoyin Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guoyin Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ting Kei Pong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ting Kei Pong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":28.0435,"has_fulltext":true,"cited_by_count":298,"citation_normalized_percentile":{"value":0.99629891,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"25","issue":"4","first_page":"2434","last_page":"2460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.5184999704360962,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.5184999704360962,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.39489999413490295,"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.04190000146627426,"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/hessian-matrix","display_name":"Hessian matrix","score":0.6543999910354614},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6312999725341797},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6018999814987183},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5853999853134155},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5274999737739563},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5266000032424927},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.48579999804496765},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46939998865127563},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4636000096797943}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8562999963760376},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.6543999910354614},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6312999725341797},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6018999814987183},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5853999853134155},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5274999737739563},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.48579999804496765},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46939998865127563},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.430400013923645},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4291999936103821},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42730000615119934},{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3772999942302704},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.3183000087738037},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C129301229","wikidata":"https://www.wikidata.org/wiki/Q741865","display_name":"Uniform continuity","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.26649999618530273}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/140998135","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140998135","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:1407.0753","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1407.0753","pdf_url":"https://arxiv.org/pdf/1407.0753","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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:unsworks.unsw.edu.au:1959.4/unsworks_47121","is_oa":true,"landing_page_url":"http://handle.unsw.edu.au/1959.4/unsworks_47121","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/44032","is_oa":false,"landing_page_url":"http://hdl.handle.net/10397/44032","pdf_url":null,"source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal/Magazine Article"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/unsworks_47121","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/unsworks_47121","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 25, 4, 2434-2460","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1407.0753","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1407.0753","pdf_url":"https://arxiv.org/pdf/1407.0753","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1967138577","https://openalex.org/W1969387119","https://openalex.org/W1970986119","https://openalex.org/W1978333359","https://openalex.org/W1980454827","https://openalex.org/W1982831910","https://openalex.org/W1997763492","https://openalex.org/W2007277085","https://openalex.org/W2021361347","https://openalex.org/W2022164193","https://openalex.org/W2037964547","https://openalex.org/W2045079045","https://openalex.org/W2048742402","https://openalex.org/W2058532290","https://openalex.org/W2059958128","https://openalex.org/W2065030431","https://openalex.org/W2065416951","https://openalex.org/W2090525223","https://openalex.org/W2129131372","https://openalex.org/W2129732816","https://openalex.org/W2142333440","https://openalex.org/W2158836590","https://openalex.org/W2611328865"],"related_works":["https://openalex.org/W2768819438","https://openalex.org/W2086328168","https://openalex.org/W1989514163","https://openalex.org/W2620834727","https://openalex.org/W2416313483","https://openalex.org/W2765202572","https://openalex.org/W2055039565","https://openalex.org/W1995300439","https://openalex.org/W2953109382","https://openalex.org/W1534737284"],"abstract_inverted_index":{"We":[0,21,138],"consider":[1],"the":[2,6,24,43,87,94,99,103,113,121,135,143,151,168,183,188,195,199,228],"problem":[3,56,186],"of":[4,8,30,46,78,91,102,107,134,142,167,180],"minimizing":[5],"sum":[7],"a":[9,14,18,28,31,37,125,131,177,216,231],"smooth":[10],"function":[11,26,34],"$h$":[12,153],"with":[13,42,187],"bounded":[15],"Hessian":[16],"and":[17,36,61,68,93,120,154],"nonsmooth":[19],"function.":[20],"assume":[22],"that":[23,111,150,198,209],"latter":[25],"is":[27,57,116,194,213,225],"composition":[29],"proper":[32],"closed":[33],"$P$":[35,155],"surjective":[38],"linear":[39],"map":[40],"$\\mathcal{M}$,":[41],"proximal":[44,95,200],"mappings":[45],"$\\tau":[47,49],"P$,":[48],">":[50],"0$,":[51],"simple":[52,161],"to":[53,164],"compute.":[54],"This":[55],"nonconvex":[58,84,136,232],"in":[59,66,227],"general":[60],"encompasses":[62],"many":[63],"important":[64],"applications":[65,181],"engineering":[67],"machine":[69],"learning.":[70],"In":[71],"this":[72,83],"paper,":[73],"we":[74,109,159,207],"examined":[75],"two":[76],"types":[77],"splitting":[79],"methods":[80],"for":[81,176,230],"solving":[82],"optimization":[85],"problem:":[86],"alternating":[88,104],"direction":[89,105],"method":[90,106],"multipliers":[92],"gradient":[96,201],"algorithm.":[97],"For":[98],"direct":[100],"adaptation":[101],"multipliers,":[108],"show":[110,208],"if":[112],"penalty":[114],"parameter":[115],"chosen":[117],"sufficiently":[118],"large":[119],"sequence":[122,145,169],"generated":[123],"has":[124],"cluster":[126,211],"point,":[127],"then":[128],"it":[129],"gives":[130],"stationary":[132,214],"point":[133,212],"problem.":[137],"also":[139],"establish":[140],"convergence":[141],"whole":[144],"under":[146,215],"an":[147],"additional":[148],"assumption":[149],"functions":[152],"are":[156],"semialgebraic.":[157],"Furthermore,":[158],"give":[160],"sufficient":[162],"conditions":[163,172],"guarantee":[165],"boundedness":[166],"generated.":[170],"These":[171],"can":[173,203],"be":[174,204],"satisfied":[175],"wide":[178],"range":[179],"including":[182],"least":[184],"squares":[185],"$\\ell_{1/2}$":[189],"regularization.":[190],"Finally,":[191],"when":[192],"$\\mathcal{M}$":[193],"identity":[196],"so":[197],"algorithm":[202],"efficiently":[205],"applied,":[206],"any":[210],"slightly":[217],"more":[218],"flexible":[219],"constant":[220],"step-size":[221],"rule":[222],"than":[223],"what":[224],"known":[226],"literature":[229],"$h$.":[233]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":33},{"year":2024,"cited_by_count":25},{"year":2023,"cited_by_count":27},{"year":2022,"cited_by_count":42},{"year":2021,"cited_by_count":38},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":35},{"year":2018,"cited_by_count":27},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":8}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2016-06-24T00:00:00"}