{"id":"https://openalex.org/W2886820818","doi":"https://doi.org/10.23919/acc.2018.8431821","title":"Prediction-Correction Dual Ascent for Time-Varying Convex Programs","display_name":"Prediction-Correction Dual Ascent for Time-Varying Convex Programs","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886820818","doi":"https://doi.org/10.23919/acc.2018.8431821","mag":"2886820818"},"language":"en","primary_location":{"id":"doi:10.23919/acc.2018.8431821","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","raw_type":"proceedings-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/A5019172720","display_name":"Andrea Simonetto","orcid":"https://orcid.org/0000-0003-2923-3361"},"institutions":[{"id":"https://openalex.org/I4210145784","display_name":"IBM Research - Ireland","ror":"https://ror.org/04jnxr720","country_code":"IE","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210145784"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Andrea Simonetto","raw_affiliation_strings":["Optimization and Control Group, IBM Research Ireland, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Optimization and Control Group, IBM Research Ireland, Dublin, Ireland","institution_ids":["https://openalex.org/I4210145784"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019172720"],"corresponding_institution_ids":["https://openalex.org/I4210145784"],"apc_list":null,"apc_paid":null,"fwci":0.8107,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.69779455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4508","last_page":"4513"},"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.9991000294685364,"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.9991000294685364,"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.9854999780654907,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dual","display_name":"Dual (grammatical number)","score":0.7981652021408081},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6580714583396912},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6303978562355042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5591097474098206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.523457944393158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4980924129486084},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4487525224685669},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35477399826049805},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3336229920387268},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07262781262397766}],"concepts":[{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7981652021408081},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6580714583396912},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6303978562355042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5591097474098206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.523457944393158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4980924129486084},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4487525224685669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35477399826049805},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3336229920387268},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07262781262397766},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc.2018.8431821","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc.2018.8431821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Annual American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W77065556","https://openalex.org/W1540481228","https://openalex.org/W1555168880","https://openalex.org/W1568288633","https://openalex.org/W1964927113","https://openalex.org/W1970735217","https://openalex.org/W1977284223","https://openalex.org/W1993647205","https://openalex.org/W1999949109","https://openalex.org/W2000340206","https://openalex.org/W2012167011","https://openalex.org/W2025447043","https://openalex.org/W2042005915","https://openalex.org/W2048100837","https://openalex.org/W2056263844","https://openalex.org/W2060139938","https://openalex.org/W2078378666","https://openalex.org/W2088986191","https://openalex.org/W2099454002","https://openalex.org/W2114085163","https://openalex.org/W2186590998","https://openalex.org/W2246760344","https://openalex.org/W2255965710","https://openalex.org/W2270353611","https://openalex.org/W2276204684","https://openalex.org/W2291507920","https://openalex.org/W2510865478","https://openalex.org/W2520934199","https://openalex.org/W2538895738","https://openalex.org/W2566859239","https://openalex.org/W2598111981","https://openalex.org/W2606681432","https://openalex.org/W2609501133","https://openalex.org/W2616333561","https://openalex.org/W2697309248","https://openalex.org/W2738184248","https://openalex.org/W2748138089","https://openalex.org/W2749664490","https://openalex.org/W2782680955","https://openalex.org/W2786652215","https://openalex.org/W2954891895","https://openalex.org/W2962917190","https://openalex.org/W2962937944","https://openalex.org/W2962944443","https://openalex.org/W2963171296","https://openalex.org/W2963763190","https://openalex.org/W2964028927","https://openalex.org/W2964167436","https://openalex.org/W3006343253","https://openalex.org/W3098928855","https://openalex.org/W3101402164","https://openalex.org/W3103470934","https://openalex.org/W3105626752","https://openalex.org/W4231183558","https://openalex.org/W4297730105","https://openalex.org/W6726499674","https://openalex.org/W6773601596","https://openalex.org/W6785777286"],"related_works":["https://openalex.org/W2317351040","https://openalex.org/W2952466936","https://openalex.org/W1988622314","https://openalex.org/W2393949104","https://openalex.org/W3046201198","https://openalex.org/W4293061921","https://openalex.org/W2807441102","https://openalex.org/W2009424630","https://openalex.org/W2372693287","https://openalex.org/W3153752017"],"abstract_inverted_index":{"We":[0,29],"develop":[1],"a":[2],"prediction-correction":[3],"dual":[4],"ascent":[5],"algorithm":[6,35],"that":[7,31,63],"tracks":[8],"the":[9,64],"optimal":[10],"primal-dual":[11,49],"pair":[12,50],"of":[13],"linearly":[14],"constrained":[15],"time-varying":[16,25],"convex":[17],"programs.":[18],"This":[19],"is":[20],"especially":[21],"useful,":[22],"e.g.,":[23],"for":[24],"distributed":[26],"optimization":[27],"problems.":[28],"prove":[30],"our":[32],"discrete":[33],"time":[34],"has":[36],"better":[37],"asymptotical":[38],"error":[39],"bound":[40],"than":[41],"state-of-the-art":[42],"methods,":[43],"which":[44],"only":[45],"correct":[46],"their":[47],"approximate":[48],"without":[51],"predicting":[52],"how":[53],"this":[54],"changes":[55],"with":[56],"time.":[57],"In":[58],"numerical":[59],"simulations,":[60],"we":[61],"show":[62],"improvement":[65],"in":[66,78],"accuracy":[67],"still":[68],"holds":[69],"even":[70],"when":[71],"computational":[72],"considerations":[73],"are":[74],"taken":[75],"into":[76],"account,":[77],"almost":[79],"all":[80],"cases.":[81]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}