{"id":"https://openalex.org/W2886434373","doi":"https://doi.org/10.1109/icc.2018.8422560","title":"A Novel Online Convex Optimization Algorithm Based on Virtual Queues","display_name":"A Novel Online Convex Optimization Algorithm Based on Virtual Queues","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2886434373","doi":"https://doi.org/10.1109/icc.2018.8422560","mag":"2886434373"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2018.8422560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Communications (ICC)","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/A5053535368","display_name":"Xuanyu Cao","orcid":"https://orcid.org/0000-0003-0190-4362"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Xuanyu Cao","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027033026","display_name":"Junshan Zhang","orcid":"https://orcid.org/0000-0002-3840-1753"},"institutions":[{"id":"https://openalex.org/I119575151","display_name":"Korea National University of Transportation","ror":"https://ror.org/03qqbe534","country_code":"KR","type":"education","lineage":["https://openalex.org/I119575151"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Junshan Zhang","raw_affiliation_strings":["Department of Electronic Engineering, Korea National University of Transportation, Chungju, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Korea National University of Transportation, Chungju, South Korea","institution_ids":["https://openalex.org/I119575151"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042307561","display_name":"H. Vincent Poor","orcid":"https://orcid.org/0000-0002-2062-131X"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"H. Vincent Poor","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.212,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59691393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9916999936103821,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9886999726295471,"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/sublinear-function","display_name":"Sublinear function","score":0.6837229132652283},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6385036110877991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5621706247329712},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5432542562484741},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.526997983455658},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5131295323371887},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4539870321750641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44298967719078064},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4406373202800751},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43847522139549255},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2892675995826721},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2832910418510437}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6837229132652283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6385036110877991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5621706247329712},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5432542562484741},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.526997983455658},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5131295323371887},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4539870321750641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44298967719078064},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4406373202800751},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43847522139549255},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2892675995826721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2832910418510437},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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":3,"locations":[{"id":"doi:10.1109/icc.2018.8422560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-113922","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-113922","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},{"id":"pmh:oai:repository.ust.hk:1783.1-113922","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=1550-3607&rft.volume=2018&rft.issue=&rft.date=2018&rft.spage=&rft.aulast=Cao&rft.aufirst=&rft.atitle=A+Novel+Online+Convex+Optimization+Algorithm+Based+on+Virtual+Queues&rft.title=IEEE+International+Conference+on+Communications","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W153281708","https://openalex.org/W1520045492","https://openalex.org/W1563975843","https://openalex.org/W1643746074","https://openalex.org/W1979289676","https://openalex.org/W1994997898","https://openalex.org/W2004001705","https://openalex.org/W2036001459","https://openalex.org/W2052671641","https://openalex.org/W2077723394","https://openalex.org/W2120881346","https://openalex.org/W2122299160","https://openalex.org/W2123705108","https://openalex.org/W2126869380","https://openalex.org/W2129160848","https://openalex.org/W2148825261","https://openalex.org/W2164278908","https://openalex.org/W2295652899","https://openalex.org/W2405727896","https://openalex.org/W2513180554","https://openalex.org/W2549367060","https://openalex.org/W2569077675","https://openalex.org/W2951777528","https://openalex.org/W2951825612","https://openalex.org/W2963576077","https://openalex.org/W2964064266","https://openalex.org/W3033868844","https://openalex.org/W3123661679","https://openalex.org/W4205841652","https://openalex.org/W4250589301","https://openalex.org/W4254313632","https://openalex.org/W4292022450","https://openalex.org/W4292363360","https://openalex.org/W6606291809","https://openalex.org/W6631271631","https://openalex.org/W6633789451","https://openalex.org/W6649087534","https://openalex.org/W6651597697","https://openalex.org/W6681723013"],"related_works":["https://openalex.org/W2149119057","https://openalex.org/W2994171794","https://openalex.org/W4288779861","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W2187449906","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W2518949622","https://openalex.org/W4382725876"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"online":[3,64],"convex":[4],"optimization":[5,53,78,128,152],"(OCO)":[6],"problems":[7,79,153],"with":[8,80,102],"time-varying":[9],"objective":[10,31,86,158],"and":[11,32,87,108,140,159],"constraint":[12,33,88,110,142,160],"functions":[13,34,89,161],"are":[14,90,112,154,176],"studied":[15],"from":[16],"the":[17,29,39,55,76,84,100,105,109,115,121,125,134,147,151,157,173,181],"perspective":[18],"of":[19,75,83,120,124,150,172,180],"an":[20],"agent":[21],"who":[22],"takes":[23],"actions":[24],"in":[25,54,118,185],"real-time.":[26],"Information":[27],"about":[28],"current":[30,85],"is":[35,42,131],"revealed":[36],"only":[37],"after":[38],"corresponding":[40],"action":[41],"already":[43],"chosen.":[44],"Inspired":[45],"by":[46],"a":[47,62,93],"fast":[48],"converging":[49],"algorithm":[50,65,117,136,175],"for":[51,70,114],"time-invariant":[52],"very":[56],"recent":[57],"work":[58],"[1],":[59],"we":[60],"develop":[61],"novel":[63],"based":[66],"on":[67,99],"virtual":[68],"queues":[69],"constrained":[71],"OCO.":[72],"Optimal":[73],"points":[74],"dynamic":[77,94,106,127],"full":[81],"knowledge":[82],"used":[91],"as":[92,144,146],"benchmark":[95,107],"sequence.":[96],"Upper":[97],"bounds":[98,171],"regrets":[101],"respect":[103],"to":[104,178],"violations":[111],"derived":[113],"presented":[116],"terms":[119],"temporal":[122,148],"variations":[123,149],"underlying":[126],"problems.":[129],"It":[130],"observed":[132],"that":[133],"proposed":[135,174],"possesses":[137],"sublinear":[138,141],"regret":[139],"violations,":[143],"long":[145],"sublinear,":[155],"i.e.,":[156],"do":[162],"not":[163],"vary":[164],"too":[165],"drastically":[166],"across":[167],"time.":[168],"The":[169],"performance":[170],"superior":[177],"those":[179],"state-of-the-art":[182],"OCO":[183],"method":[184],"most":[186],"scenarios.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}