{"id":"https://openalex.org/W2766258127","doi":"https://doi.org/10.23919/eusipco.2017.8081184","title":"Online convex optimization for dynamic network resource allocation","display_name":"Online convex optimization for dynamic network resource allocation","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2766258127","doi":"https://doi.org/10.23919/eusipco.2017.8081184","mag":"2766258127"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco.2017.8081184","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2017.8081184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 25th European Signal Processing Conference (EUSIPCO)","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/A5100783476","display_name":"Tianyi Chen","orcid":"https://orcid.org/0000-0003-3477-1439"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tianyi Chen","raw_affiliation_strings":["Dept. of Elec. & Comput. Engr. and Digital Technology Center, University of Minnesota, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Elec. & Comput. Engr. and Digital Technology Center, University of Minnesota, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029820392","display_name":"Qing Ling","orcid":"https://orcid.org/0000-0003-4222-5964"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qing Ling","raw_affiliation_strings":["Dept. of Automation, University of Science and Technology of China, China"],"affiliations":[{"raw_affiliation_string":"Dept. of Automation, University of Science and Technology of China, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026758314","display_name":"Georgios B. Giannakis","orcid":"https://orcid.org/0000-0002-0196-0260"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Georgios B. Giannakis","raw_affiliation_strings":["Dept. of Elec. & Comput. Engr. and Digital Technology Center, University of Minnesota, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Elec. & Comput. Engr. and Digital Technology Center, University of Minnesota, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100783476"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":1.55,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8507199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"136","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965000152587891,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7267684936523438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6878483295440674},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6651833057403564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5956951379776001},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5768094658851624},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.557803213596344},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5122939348220825},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5037338137626648},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4964771866798401},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4943411350250244},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.44251275062561035},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41715115308761597},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4114410877227783},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3912937343120575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2547111511230469},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12087512016296387}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7267684936523438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6878483295440674},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6651833057403564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5956951379776001},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5768094658851624},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.557803213596344},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5122939348220825},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5037338137626648},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4964771866798401},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4943411350250244},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.44251275062561035},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41715115308761597},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4114410877227783},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3912937343120575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2547111511230469},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12087512016296387},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/eusipco.2017.8081184","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2017.8081184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 25th European Signal Processing Conference (EUSIPCO)","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":21,"referenced_works":["https://openalex.org/W1520045492","https://openalex.org/W1643746074","https://openalex.org/W1836902361","https://openalex.org/W1979289676","https://openalex.org/W2127142495","https://openalex.org/W2129160848","https://openalex.org/W2137152139","https://openalex.org/W2148825261","https://openalex.org/W2331891307","https://openalex.org/W2531862309","https://openalex.org/W2559981761","https://openalex.org/W2798766386","https://openalex.org/W2951777528","https://openalex.org/W2951825612","https://openalex.org/W2963201118","https://openalex.org/W2963732316","https://openalex.org/W3123661679","https://openalex.org/W4254313632","https://openalex.org/W6631271631","https://openalex.org/W6678510960","https://openalex.org/W6681723013"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W3036663304","https://openalex.org/W2510140549","https://openalex.org/W2187449906","https://openalex.org/W2962818859"],"abstract_inverted_index":{"The":[0],"present":[1],"paper":[2],"deals":[3],"with":[4,61,125],"online":[5,41,96],"convex":[6],"optimization":[7],"involving":[8],"adversarial":[9,13],"loss":[10,66],"functions":[11],"and":[12,23,68,102,110,120,137],"constraints,":[14],"where":[15],"the":[16,35,50,57,65,69,79,114,131,141],"constraints":[17,121],"are":[18,122],"revealed":[19],"after":[20],"making":[21],"decisions,":[22],"can":[24],"be":[25,32],"tolerable":[26],"to":[27,56,104,130,139],"instantaneous":[28],"violations":[29,84],"but":[30],"must":[31],"satisfied":[33],"in":[34,43],"long":[36],"term.":[37],"Performance":[38],"of":[39,52,64,82,117],"an":[40],"algorithm":[42],"this":[44,92],"setting":[45],"is":[46,72,86,100,128],"assessed":[47],"by:":[48],"i)":[49],"difference":[51],"its":[53],"losses":[54],"relative":[55],"best":[58],"dynamic":[59,75,89,108,132],"solution":[60],"one-slot-ahead":[62],"information":[63],"function":[67],"constraint":[70,83],"(that":[71,85],"here":[73,87],"termed":[74,88],"regret);":[76],"and,":[77],"ii)":[78],"accumulated":[80,115],"amount":[81],"fit).":[90],"In":[91],"context,":[93],"a":[94],"modified":[95],"saddle-point":[97],"(MOSP)":[98],"scheme":[99],"developed,":[101],"proved":[103],"simultaneously":[105],"yield":[106],"sub-linear":[107],"regret":[109],"fit,":[111],"provided":[112],"that":[113],"variations":[116],"per-slot":[118],"minimizers":[119],"sub-linearly":[123],"growing":[124],"time.":[126],"MOSP":[127],"applied":[129],"network":[133],"resource":[134],"allocation":[135],"task,":[136],"shown":[138],"outperform":[140],"well-known":[142],"stochastic":[143],"dual":[144],"gradient":[145],"method.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}