{"id":"https://openalex.org/W2791165053","doi":"https://doi.org/10.1109/infocom.2018.8486362","title":"Competitive Online Convex Optimization with Switching Costs and Ramp Constraints","display_name":"Competitive Online Convex Optimization with Switching Costs and Ramp Constraints","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2791165053","doi":"https://doi.org/10.1109/infocom.2018.8486362","mag":"2791165053"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2018.8486362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8486362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","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/A5020579600","display_name":"Ming Shi","orcid":"https://orcid.org/0000-0001-9941-9095"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ming Shi","raw_affiliation_strings":["School of Electrical and Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082208896","display_name":"Xiaojun Lin","orcid":"https://orcid.org/0000-0001-9117-7212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaojun Lin","raw_affiliation_strings":["School of Electrical and Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014376333","display_name":"Sonia Fahmy","orcid":"https://orcid.org/0000-0003-2870-7166"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sonia Fahmy","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078127113","display_name":"Donghoon Shin","orcid":"https://orcid.org/0000-0003-1078-1181"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dong-Hoon Shin","raw_affiliation_strings":["AT&T Labs, San Ramon, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs, San Ramon, CA, USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1835","last_page":"1843"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustification","display_name":"Robustification","score":0.7792009115219116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7395293712615967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6532498598098755},{"id":"https://openalex.org/keywords/orchestration","display_name":"Orchestration","score":0.6519306898117065},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5579610466957092},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5211601257324219},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.488798588514328},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.4764316976070404},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4733410179615021},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45483630895614624},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.44769561290740967},{"id":"https://openalex.org/keywords/virtualization","display_name":"Virtualization","score":0.4359256625175476},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.36380910873413086},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.2037263810634613},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12865996360778809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11514586210250854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.108491450548172}],"concepts":[{"id":"https://openalex.org/C2778584072","wikidata":"https://www.wikidata.org/wiki/Q7353545","display_name":"Robustification","level":3,"score":0.7792009115219116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7395293712615967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6532498598098755},{"id":"https://openalex.org/C199168358","wikidata":"https://www.wikidata.org/wiki/Q3367000","display_name":"Orchestration","level":3,"score":0.6519306898117065},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5579610466957092},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5211601257324219},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.488798588514328},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4764316976070404},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4733410179615021},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45483630895614624},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.44769561290740967},{"id":"https://openalex.org/C513985346","wikidata":"https://www.wikidata.org/wiki/Q270471","display_name":"Virtualization","level":3,"score":0.4359256625175476},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.36380910873413086},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.2037263810634613},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12865996360778809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11514586210250854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.108491450548172},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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.1109/infocom.2018.8486362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8486362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","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":34,"referenced_works":["https://openalex.org/W56687990","https://openalex.org/W1553785337","https://openalex.org/W1569503125","https://openalex.org/W1578960134","https://openalex.org/W2031279008","https://openalex.org/W2036001459","https://openalex.org/W2043352445","https://openalex.org/W2050883740","https://openalex.org/W2077723394","https://openalex.org/W2120881346","https://openalex.org/W2126869380","https://openalex.org/W2129160848","https://openalex.org/W2168936382","https://openalex.org/W2210790443","https://openalex.org/W2243257940","https://openalex.org/W2292935145","https://openalex.org/W2331891307","https://openalex.org/W2415016509","https://openalex.org/W2478126563","https://openalex.org/W2558513815","https://openalex.org/W2562956987","https://openalex.org/W2586118222","https://openalex.org/W2592542720","https://openalex.org/W2755273542","https://openalex.org/W2762662031","https://openalex.org/W2791165053","https://openalex.org/W2949608614","https://openalex.org/W3033868844","https://openalex.org/W3143187486","https://openalex.org/W4250589301","https://openalex.org/W4251616545","https://openalex.org/W4292022450","https://openalex.org/W6690661474","https://openalex.org/W6702392987"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"We":[0,45,131],"investigate":[1],"competitive":[2,43,57,82],"online":[3,6,37,118],"algorithms":[4],"for":[5,125],"convex":[7],"optimization":[8],"(OCO)":[9],"problems":[10,22],"with":[11],"linear":[12],"in-stage":[13],"costs,":[14],"switching":[15],"costs":[16,76],"and":[17,77,128,142],"ramp":[18],"constraints.":[19,78,108],"While":[20],"OCO":[21],"have":[23],"been":[24],"extensively":[25],"studied":[26],"in":[27,84],"the":[28,35,61,85,146],"literature,":[29,86],"there":[30],"are":[31],"limited":[32],"results":[33,83],"on":[34,60,136],"corresponding":[36],"solutions":[38],"that":[39,52,95,120],"can":[40,53,69,97,121],"attain":[41,122],"small":[42],"ratios.":[44],"first":[46],"develop":[47],"a":[48,71,87,112,133],"powerful":[49],"computational":[50,67],"framework":[51,68],"compute":[54],"an":[55,117],"optimized":[56],"ratio":[58],"based":[59],"class":[62,74],"of":[63,75,90,148],"affine":[64],"policies.":[65],"Our":[66],"handle":[70,98],"fairly":[72],"general":[73],"Compared":[79],"to":[80,105,115,144],"other":[81],"key":[88],"feature":[89],"our":[91,149],"proposed":[92,150],"approach":[93],"is":[94],"it":[96],"scenarios":[99],"where":[100],"infeasibility":[101],"may":[102],"arise":[103],"due":[104],"hard":[106],"feasibility":[107],"Second,":[109],"we":[110],"design":[111],"robustification":[113],"procedure":[114],"produce":[116],"algorithm":[119],"good":[123],"performance":[124],"both":[126],"average-case":[127],"worst-case":[129],"inputs.":[130],"conduct":[132],"case":[134],"study":[135],"Network":[137],"Functions":[138],"Virtualization":[139],"(NFV)":[140],"orchestration":[141],"scaling":[143],"demonstrate":[145],"effectiveness":[147],"methods.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}