{"id":"https://openalex.org/W2994391678","doi":"https://doi.org/10.1109/allerton.2019.8919772","title":"Cubic Regularized ADMM with Convergence to a Local Minimum in Non-convex Optimization","display_name":"Cubic Regularized ADMM with Convergence to a Local Minimum in Non-convex Optimization","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2994391678","doi":"https://doi.org/10.1109/allerton.2019.8919772","mag":"2994391678"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2019.8919772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5029338309","display_name":"Zai Shi","orcid":"https://orcid.org/0000-0002-6403-5822"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zai Shi","raw_affiliation_strings":["The Ohio State University,Columbus,OH,USA,43210","The Ohio State University, Columbus, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Columbus,OH,USA,43210","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076974020","display_name":"Atilla Ery\u0131lmaz","orcid":"https://orcid.org/0000-0001-5560-5806"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atilla Eryilmaz","raw_affiliation_strings":["The Ohio State University,Columbus,OH,USA,43210","The Ohio State University, Columbus, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Columbus,OH,USA,43210","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"269","issue":null,"first_page":"407","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9908000230789185,"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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/hessian-matrix","display_name":"Hessian matrix","score":0.8936550617218018},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.7327272295951843},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6980963349342346},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.6850402355194092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5999562740325928},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5721025466918945},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5179449915885925},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49677568674087524},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.46719714999198914},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4468023180961609},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.44607120752334595},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.43834561109542847},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.4347118139266968},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41075536608695984},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40615564584732056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2656499147415161},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2627148926258087},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11069637537002563}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8936550617218018},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.7327272295951843},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6980963349342346},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.6850402355194092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5999562740325928},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5721025466918945},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5179449915885925},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49677568674087524},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.46719714999198914},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4468023180961609},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.44607120752334595},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.43834561109542847},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.4347118139266968},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41075536608695984},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40615564584732056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2656499147415161},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2627148926258087},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11069637537002563},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2019.8919772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W48643329","https://openalex.org/W1697075315","https://openalex.org/W1899249567","https://openalex.org/W2008732654","https://openalex.org/W2009941369","https://openalex.org/W2046033161","https://openalex.org/W2134618502","https://openalex.org/W2135046866","https://openalex.org/W2164278908","https://openalex.org/W2216139520","https://openalex.org/W2398500126","https://openalex.org/W2546420264","https://openalex.org/W2549393568","https://openalex.org/W2560848383","https://openalex.org/W2561193401","https://openalex.org/W2571268788","https://openalex.org/W2592651140","https://openalex.org/W2610857016","https://openalex.org/W2612654412","https://openalex.org/W2767380555","https://openalex.org/W2772283936","https://openalex.org/W2774094051","https://openalex.org/W2788706426","https://openalex.org/W2911244395","https://openalex.org/W2936995161","https://openalex.org/W2962853966","https://openalex.org/W2962876518","https://openalex.org/W2963092340","https://openalex.org/W2963433607","https://openalex.org/W2963487351","https://openalex.org/W2964106499","https://openalex.org/W2964156132","https://openalex.org/W3115592686","https://openalex.org/W3124367822","https://openalex.org/W4206310440","https://openalex.org/W4292363360","https://openalex.org/W4298092895","https://openalex.org/W6637461557","https://openalex.org/W6639736602","https://openalex.org/W6680025182","https://openalex.org/W6688447623","https://openalex.org/W6712153814","https://openalex.org/W6729335273","https://openalex.org/W6730290784","https://openalex.org/W6730741932","https://openalex.org/W6734280532","https://openalex.org/W6737542523","https://openalex.org/W6745438911","https://openalex.org/W6746152743","https://openalex.org/W6746968802","https://openalex.org/W6748181190","https://openalex.org/W6757936599","https://openalex.org/W6761030284"],"related_works":["https://openalex.org/W1978576933","https://openalex.org/W1981914421","https://openalex.org/W4236459141","https://openalex.org/W3125203780","https://openalex.org/W4205304778","https://openalex.org/W2020252434","https://openalex.org/W2978731891","https://openalex.org/W1979925556","https://openalex.org/W73248859","https://openalex.org/W2153649672"],"abstract_inverted_index":{"How":[0],"to":[1,47,69,114,131],"escape":[2,48],"saddle":[3,49],"points":[4,50],"is":[5,23,91,129,160],"a":[6,27,56,62,70,78,115,133,137],"critical":[7],"issue":[8,16],"in":[9,86,152],"non-convex":[10,53,157],"optimization.":[11],"Previous":[12],"methods":[13],"on":[14],"this":[15,35],"mainly":[17],"assume":[18],"that":[19,66,99],"the":[20,74,118,122],"objective":[21],"function":[22,76],"Hessian-Lipschitz,":[24],"which":[25,90],"leave":[26],"gap":[28,140],"for":[29],"applications":[30,151],"using":[31],"non-Hessian-Lipschitz":[32,57],"functions.":[33],"In":[34],"paper,":[36],"we":[37,64],"propose":[38],"Cubic":[39],"Regularized":[40],"Alternating":[41],"Direction":[42],"Method":[43],"of":[44,51,73,80,105,117,124,166],"Multipliers":[45],"(CR-ADMM)":[46],"separable":[52],"functions":[54],"containing":[55],"component.":[58],"By":[59],"carefully":[60],"choosing":[61],"parameter,":[63],"prove":[65],"CR-ADMM":[67,106],"converges":[68],"local":[71,119],"minimum":[72],"original":[75],"with":[77,142],"rate":[79,135],"O(1/T":[81],"<sup":[82],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[83],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1/3</sup>":[84],")":[85],"time":[87],"horizon":[88],"T,":[89],"faster":[92,134],"than":[93],"gradient-based":[94,144],"methods.":[95,145],"We":[96],"also":[97,149],"show":[98],"when":[100],"one":[101],"or":[102],"more":[103],"steps":[104],"are":[107],"not":[108],"solved":[109],"exactly,":[110],"CRADMM":[111,128],"can":[112,148],"converge":[113],"neighborhood":[116],"minimum.":[120],"Through":[121],"experiments":[123],"matrix":[125],"factorization":[126],"problems,":[127],"shown":[130],"have":[132],"and":[136],"lower":[138],"optimality":[139],"compared":[141],"other":[143,153],"Our":[146],"approach":[147],"find":[150],"scenarios":[154],"where":[155],"regularized":[156],"cost":[158],"minimization":[159],"performed,":[161],"such":[162],"as":[163],"parameter":[164],"optimization":[165],"deep":[167],"neural":[168],"networks.":[169]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}