{"id":"https://openalex.org/W2886061910","doi":"https://doi.org/10.1109/icc.2018.8422559","title":"On the Time-Varying Constraints and Bandit Feedback of Online Convex Optimization","display_name":"On the Time-Varying Constraints and Bandit Feedback of Online Convex Optimization","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2886061910","doi":"https://doi.org/10.1109/icc.2018.8422559","mag":"2886061910"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2018.8422559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422559","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/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Xuanyu Cao","raw_affiliation_strings":["Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032395820","display_name":"K. J. Ray Liu","orcid":"https://orcid.org/0000-0001-5469-5811"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"K. J. Ray Liu","raw_affiliation_strings":["Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.4241,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68570164,"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":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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":1.0,"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.9965000152587891,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.8729878664016724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6704015731811523},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.636001467704773},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5772819519042969},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5721361637115479},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5295254588127136},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5082497000694275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5059584975242615},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.48950254917144775},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4848133623600006},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47123417258262634},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46126917004585266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36440905928611755},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.22968971729278564},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08762982487678528},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.06813859939575195}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8729878664016724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6704015731811523},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.636001467704773},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5772819519042969},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5721361637115479},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5295254588127136},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5082497000694275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5059584975242615},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.48950254917144775},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4848133623600006},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47123417258262634},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46126917004585266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36440905928611755},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.22968971729278564},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08762982487678528},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.06813859939575195},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icc.2018.8422559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2018.8422559","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-113920","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-113920","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-113920","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85051438837&origin=inward","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"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/W2077723394","https://openalex.org/W2120881346","https://openalex.org/W2126869380","https://openalex.org/W2129160848","https://openalex.org/W2148825261","https://openalex.org/W2405727896","https://openalex.org/W2513180554","https://openalex.org/W2549367060","https://openalex.org/W2569077675","https://openalex.org/W2798766386","https://openalex.org/W2951777528","https://openalex.org/W2951825612","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/W6606291809","https://openalex.org/W6631271631","https://openalex.org/W6633789451","https://openalex.org/W6651597697","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/W3039767703","https://openalex.org/W2149119057","https://openalex.org/W2994171794","https://openalex.org/W2187449906","https://openalex.org/W2962818859"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"online":[3,73,173,195,199],"convex":[4],"optimization":[5,123],"(OCO)":[6],"problem":[7],"with":[8,94],"time-varying":[9],"constraints":[10],"is":[11,58,66,86,114,143,175],"studied":[12],"from":[13],"the":[14,23,27,37,42,52,61,89,97,108,111,120,133,146,149,153,162,167,206,209,215],"perspective":[15],"of":[16,44,110,135,148,172,208],"an":[17,64,141],"agent":[18,62],"taking":[19],"sequential":[20],"actions.":[21],"Both":[22],"objective":[24,53,150],"function":[25,45,54,151],"and":[26,32,55,101,152,177,185,198,212],"constraint":[28,56,103,154,188],"functions":[29,57,155],"are":[30,164,202],"dynamic":[31,98,122],"unknown":[33],"a":[34,70],"priori":[35],"to":[36,60,96,161,166,204,213],"agent.":[38,168],"We":[39,68],"first":[40],"consider":[41],"scenario":[43,134],"feedback,":[46,137],"in":[47,117,138],"which":[48,75],"complete":[49],"information":[50],"about":[51],"revealed":[59],"after":[63,140],"action":[65,142,163],"submitted.":[67],"propose":[69],"computationally":[71],"efficient":[72],"algorithm,":[74],"only":[76,145],"involves":[77],"direct":[78],"closed-form":[79],"computations":[80],"at":[81,156],"each":[82],"time":[83],"instant.":[84],"It":[85],"shown":[87],"that":[88],"algorithm":[90,174],"possesses":[91],"sublinear":[92,102,182,186],"regret":[93,184],"respect":[95],"benchmark":[99,112],"sequence":[100,113],"violations,":[104],"as":[105,107],"long":[106],"drift":[109],"sublinear,":[115],"or":[116],"other":[118],"words,":[119],"underlying":[121],"problems":[124],"do":[125],"not":[126],"vary":[127],"too":[128],"drastically.":[129],"Furthermore,":[130],"we":[131,178],"investigate":[132],"bandit":[136,170],"which,":[139],"chosen,":[144],"values":[147],"several":[157],"random":[158],"points":[159],"close":[160],"announced":[165],"A":[169],"version":[171],"proposed":[176,210],"also":[179],"establish":[180],"its":[181],"expected":[183,187],"violations.":[189],"Finally,":[190],"two":[191],"numerical":[192],"examples,":[193],"namely":[194],"quadratic":[196],"programming":[197],"logistic":[200],"regression,":[201],"presented":[203],"corroborate":[205],"effectiveness":[207],"algorithms":[211],"confirm":[214],"theoretical":[216],"guarantees.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}