{"id":"https://openalex.org/W2902440224","doi":"https://doi.org/10.1109/tac.2018.2884653","title":"Online Convex Optimization With Time-Varying Constraints and Bandit Feedback","display_name":"Online Convex Optimization With Time-Varying Constraints and Bandit Feedback","publication_year":2018,"publication_date":"2018-12-03","ids":{"openalex":"https://openalex.org/W2902440224","doi":"https://doi.org/10.1109/tac.2018.2884653","mag":"2902440224"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2018.2884653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2018.2884653","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-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/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuanyu Cao","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-0190-4362","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"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/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. J. Ray Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0001-5469-5811","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.605,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.96816423,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"64","issue":"7","first_page":"2665","last_page":"2680"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.8729461431503296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6699116230010986},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5940676927566528},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5567509531974792},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5490531921386719},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5231857895851135},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.491792231798172},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4853002429008484},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47888678312301636},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47714683413505554},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4752497375011444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44360631704330444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4226863980293274},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.20432621240615845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07755923271179199},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.06894117593765259}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8729461431503296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6699116230010986},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5940676927566528},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5567509531974792},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5490531921386719},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5231857895851135},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.491792231798172},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4853002429008484},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47888678312301636},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47714683413505554},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4752497375011444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44360631704330444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4226863980293274},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.20432621240615845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07755923271179199},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.06894117593765259},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tac.2018.2884653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2018.2884653","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-113915","is_oa":false,"landing_page_url":"https://repository.hkust.edu.hk/ir/Record/1783.1-113915","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":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-113915","is_oa":false,"landing_page_url":"http://repository.ust.hk/ir/Record/1783.1-113915","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":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":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/W2004001705","https://openalex.org/W2052671641","https://openalex.org/W2077723394","https://openalex.org/W2078303776","https://openalex.org/W2120881346","https://openalex.org/W2122299160","https://openalex.org/W2126869380","https://openalex.org/W2129160848","https://openalex.org/W2148825261","https://openalex.org/W2255965710","https://openalex.org/W2296319761","https://openalex.org/W2405727896","https://openalex.org/W2415016509","https://openalex.org/W2513180554","https://openalex.org/W2549367060","https://openalex.org/W2566859239","https://openalex.org/W2569077675","https://openalex.org/W2798766386","https://openalex.org/W2951777528","https://openalex.org/W2951825612","https://openalex.org/W2962917190","https://openalex.org/W2964064266","https://openalex.org/W2964309292","https://openalex.org/W3033868844","https://openalex.org/W3123661679","https://openalex.org/W4205841652","https://openalex.org/W4244633107","https://openalex.org/W4250589301","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/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2949801578","https://openalex.org/W3039767703","https://openalex.org/W2149119057","https://openalex.org/W2994171794","https://openalex.org/W2187449906","https://openalex.org/W3011190762"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"online":[3,76,178,212,216],"convex":[4],"optimization":[5,126],"problem":[6],"with":[7,97],"time-varying":[8],"constraints":[9],"is":[10,69,89,117,147,180,205],"studied":[11],"from":[12],"the":[13,22,26,36,41,44,49,54,61,92,100,111,114,123,136,139,150,153,157,166,171,177,196,199,202,223,226,232],"perspective":[14],"of":[15,43,53,113,138,152,176,201,225],"an":[16,67,145],"agent":[17],"taking":[18],"sequential":[19],"actions.":[20],"Both":[21],"objective":[23,55,154],"function":[24,56,155],"and":[25,31,51,57,104,156,182,190,215,229],"constraint":[27,58,106,158,193],"functions":[28,59,159],"are":[29,64,168,219],"dynamic":[30,101,125],"unknown":[32],"a":[33,73],"priori":[34],"to":[35,99,165,170,221,230],"agent.":[37,172],"We":[38,71],"first":[39],"consider":[40],"scenario":[42,137],"gradient":[45],"feedback,":[46,141],"in":[47,120,142],"which,":[48,143],"values":[50,151],"gradients":[52],"at":[60,84,160],"chosen":[62],"action":[63,68,146,167],"revealed":[65],"after":[66,144],"submitted.":[70],"propose":[72],"computationally":[74],"efficient":[75],"algorithm,":[77],"which":[78],"only":[79,149],"involves":[80],"direct":[81],"closed-form":[82],"computations":[83],"each":[85],"time":[86],"instant.":[87],"It":[88],"shown":[90],"that":[91,198],"algorithm":[93,179],"possesses":[94],"sublinear":[95,105,187,191],"regret":[96,189],"respect":[98],"benchmark":[102,115,203],"sequence":[103,116,204],"violations,":[107],"as":[108,110],"long":[109],"drift":[112,200],"sublinear,":[118],"or":[119],"other":[121],"words,":[122],"underlying":[124],"problems":[127],"do":[128],"not":[129],"vary":[130],"too":[131],"drastically.":[132],"Furthermore,":[133],"we":[134,183],"investigate":[135],"bandit":[140,174],"chosen,":[148],"several":[161],"random":[162],"points":[163],"close":[164],"announced":[169],"A":[173],"version":[175],"proposed":[181,227],"also":[184],"establish":[185],"its":[186],"expected":[188,192],"violations":[194],"under":[195],"assumption":[197],"sublinear.":[206],"Finally,":[207],"two":[208],"numerical":[209],"examples,":[210],"namely":[211],"quadratic":[213],"programming":[214],"logistic":[217],"regression,":[218],"presented":[220],"corroborate":[222],"effectiveness":[224],"algorithms":[228],"confirm":[231],"theoretical":[233],"guarantees.":[234]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}