{"id":"https://openalex.org/W3185815335","doi":"https://doi.org/10.23919/acc50511.2021.9483303","title":"Escaping Spurious Local Minimum Trajectories in Online Time-varying Nonconvex Optimization","display_name":"Escaping Spurious Local Minimum Trajectories in Online Time-varying Nonconvex Optimization","publication_year":2021,"publication_date":"2021-05-25","ids":{"openalex":"https://openalex.org/W3185815335","doi":"https://doi.org/10.23919/acc50511.2021.9483303","mag":"3185815335"},"language":"en","primary_location":{"id":"doi:10.23919/acc50511.2021.9483303","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc50511.2021.9483303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 American Control Conference (ACC)","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/A5102879163","display_name":"Yuhao Ding","orcid":"https://orcid.org/0000-0002-1521-7566"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuhao Ding","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042580848","display_name":"Javad Lavaei","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javad Lavaei","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025743742","display_name":"Murat Arcak","orcid":"https://orcid.org/0000-0001-9060-4032"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Murat Arcak","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"454","last_page":"461"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6377640962600708},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6087489724159241},{"id":"https://openalex.org/keywords/spurious-relationship","display_name":"Spurious relationship","score":0.5739424228668213},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5212838649749756},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5094659924507141},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5084299445152283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5005981922149658},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4832480847835541},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4800871014595032},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4531136751174927},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4411618113517761},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4218323230743408},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4171158969402313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39650100469589233},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3921474814414978}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6377640962600708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6087489724159241},{"id":"https://openalex.org/C97256817","wikidata":"https://www.wikidata.org/wiki/Q1462316","display_name":"Spurious relationship","level":2,"score":0.5739424228668213},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5212838649749756},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5094659924507141},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5084299445152283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5005981922149658},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4832480847835541},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4800871014595032},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4531136751174927},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4411618113517761},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4218323230743408},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4171158969402313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39650100469589233},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3921474814414978},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc50511.2021.9483303","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc50511.2021.9483303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W1507599800","https://openalex.org/W1697075315","https://openalex.org/W1999698136","https://openalex.org/W2184596805","https://openalex.org/W2255965710","https://openalex.org/W2329836717","https://openalex.org/W2405479119","https://openalex.org/W2513180554","https://openalex.org/W2528062157","https://openalex.org/W2592651140","https://openalex.org/W2601846890","https://openalex.org/W2609501133","https://openalex.org/W2616333561","https://openalex.org/W2796922012","https://openalex.org/W2898801856","https://openalex.org/W2903451074","https://openalex.org/W2946348561","https://openalex.org/W2951248065","https://openalex.org/W2962944443","https://openalex.org/W2963092340","https://openalex.org/W2963317585","https://openalex.org/W2963404710","https://openalex.org/W2963430672","https://openalex.org/W2964106499","https://openalex.org/W2964156132","https://openalex.org/W2964225338","https://openalex.org/W2973510742","https://openalex.org/W2990558591","https://openalex.org/W3027190643","https://openalex.org/W3103457637","https://openalex.org/W3167970296","https://openalex.org/W4205841652","https://openalex.org/W4242126878","https://openalex.org/W4289147437","https://openalex.org/W4297686031","https://openalex.org/W4297730105","https://openalex.org/W6637461557","https://openalex.org/W6686565794","https://openalex.org/W6712153814","https://openalex.org/W6713869322","https://openalex.org/W6727883105","https://openalex.org/W6737145779","https://openalex.org/W6748278370","https://openalex.org/W6750188453","https://openalex.org/W6755725002","https://openalex.org/W6756534140","https://openalex.org/W6757766478","https://openalex.org/W6757872972","https://openalex.org/W6762868129","https://openalex.org/W6767779918","https://openalex.org/W6770905367"],"related_works":["https://openalex.org/W2460653416","https://openalex.org/W2024964462","https://openalex.org/W148192211","https://openalex.org/W2074869363","https://openalex.org/W2087212699","https://openalex.org/W1921497609","https://openalex.org/W2355646586","https://openalex.org/W2037420682","https://openalex.org/W2078829278","https://openalex.org/W2154263621"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,21,123,153],"concerned":[3],"with":[4,14,53,81],"solving":[5],"online":[6,31,65],"nonconvex":[7],"optimization":[8,32,79],"problems":[9],"using":[10],"simple":[11],"gradient-based":[12],"algorithms":[13],"an":[15,30],"arbitrary":[16],"initialization.":[17],"The":[18],"main":[19],"objective":[20],"to":[22,143],"understand":[23],"how":[24,148],"the":[25,45,60,64,72,87,90,96,101,105,113,119,127,149],"natural":[26],"data":[27],"variation":[28,99],"of":[29,47,63,89,100,130],"problem":[33,80,102],"affects":[34],"finding":[35],"its":[36],"time-varying":[37,49,161],"global":[38,120,162],"minima.":[39],"To":[40],"this":[41],"end,":[42],"we":[43],"investigate":[44],"properties":[46],"a":[48,76,82,109,160],"gradient":[50],"flow":[51],"system":[52],"inertia,":[54],"which":[55],"can":[56],"be":[57],"regarded":[58],"as":[59],"continuous-time":[61],"limit":[62],"tracking":[66,132],"scheme":[67],"obtained":[68],"by":[69],"working":[70],"through":[71],"optimality":[73],"conditions":[74,140],"for":[75,135],"discretized":[77],"sequential":[78],"proximal":[83,110],"regularization.":[84],"We":[85],"introduce":[86],"notion":[88],"dominant":[91],"trajectory":[92,122],"and":[93,107,133,158],"show":[94],"that":[95,145],"inherent":[97],"temporal":[98],"could":[103],"re-shape":[104],"landscape":[106],"help":[108],"algorithm":[111],"escape":[112],"spurious":[114],"local":[115,150],"minimum":[116,121],"trajectories":[117],"if":[118],"dominant.":[124],"By":[125],"studying":[126],"three":[128],"notions":[129],"jumping,":[131],"escaping":[134],"nonlinear":[136],"dynamical":[137],"systems,":[138],"sufficient":[139],"are":[141],"derived":[142],"guarantee":[144],"no":[146],"matter":[147],"search":[151],"method":[152],"initialized,":[154],"it":[155],"will":[156],"find":[157],"track":[159],"solution":[163],"after":[164],"some":[165],"time.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}