{"id":"https://openalex.org/W7123360350","doi":"https://doi.org/10.1109/cdc57313.2025.11312435","title":"Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis","display_name":"Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123360350","doi":"https://doi.org/10.1109/cdc57313.2025.11312435"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5071464165","display_name":"Fabian Jakob","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Jakob","raw_affiliation_strings":["University of Stuttgart,Institute for Systems Theory and Automatic Control,Stuttgart,Germany,70569"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart,Institute for Systems Theory and Automatic Control,Stuttgart,Germany,70569","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088084632","display_name":"Andrea M. Iannelli","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrea Iannelli","raw_affiliation_strings":["University of Stuttgart,Institute for Systems Theory and Automatic Control,Stuttgart,Germany,70569"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart,Institute for Systems Theory and Automatic Control,Stuttgart,Germany,70569","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6298","last_page":"6303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7684000134468079,"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.7684000134468079,"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.16820000112056732,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.012000000104308128,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7720999717712402},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.598800003528595},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5834000110626221},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.571399986743927},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5576000213623047},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5072000026702881},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5038999915122986},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.49729999899864197},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4392000138759613}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7720999717712402},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.598800003528595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5938000082969666},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5834000110626221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5806999802589417},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.571399986743927},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5576000213623047},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.436599999666214},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3395000100135803},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3370000123977661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32839998602867126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C43994743","wikidata":"https://www.wikidata.org/wiki/Q516776","display_name":"Measurable function","level":3,"score":0.3052000105381012},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2840999960899353},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C33962884","wikidata":"https://www.wikidata.org/wiki/Q378637","display_name":"Dynamical system (definition)","level":3,"score":0.25440001487731934},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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":15,"referenced_works":["https://openalex.org/W1979289676","https://openalex.org/W2097460613","https://openalex.org/W2097944741","https://openalex.org/W2129160848","https://openalex.org/W2513180554","https://openalex.org/W2763081248","https://openalex.org/W2964309292","https://openalex.org/W3011830603","https://openalex.org/W3023085450","https://openalex.org/W3185331213","https://openalex.org/W4206526750","https://openalex.org/W4315471860","https://openalex.org/W4392168753","https://openalex.org/W4415797917","https://openalex.org/W7123360350"],"related_works":[],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,25,32,46,53,64,71,144],"novel":[3],"approach":[4,155],"for":[5,16,74],"analyzing":[6],"dynamic":[7],"regret":[8,72,162],"of":[9,35,45,82,90,102,104,110,114,138,143,153,160],"first-order":[10,36,54],"online":[11,76],"convex":[12,18],"optimization":[13],"(OCO)":[14],"algorithms":[15,37],"strongly":[17],"and":[19,118],"Lipschitz-smooth":[20],"objectives.":[21],"Crucially,":[22],"we":[23,62],"provide":[24],"general":[26],"analysis":[27],"that":[28,38,142],"is":[29,85],"applicable":[30],"to":[31,92,125,156],"wide":[33],"range":[34],"can":[39],"be":[40],"expressed":[41],"as":[42,87],"an":[43],"interconnection":[44],"linear":[47],"dynamical":[48],"system":[49],"in":[50,107,128],"feedback":[51],"with":[52],"oracle.":[55],"By":[56],"leveraging":[57],"Integral":[58],"Quadratic":[59],"Constraints":[60],"(IQCs),":[61],"derive":[63],"semi-definite":[65],"program":[66],"which,":[67],"when":[68],"feasible,":[69],"provides":[70],"guarantee":[73],"the":[75,80,88,99,105,108,111,115,119,136,151,154,158,161,164],"algorithm.":[77],"For":[78],"this,":[79],"concept":[81],"variational":[83],"IQCs":[84,91],"introduced":[86],"generalization":[89],"time-varying":[93,116],"monotone":[94],"operators.":[95],"Our":[96],"bounds":[97],"capture":[98,157],"temporal":[100],"rate":[101],"change":[103],"problem":[106],"form":[109],"path":[112],"length":[113],"minimizer":[117],"objective":[120],"function":[121,165],"variation.":[122],"In":[123],"contrast":[124],"standard":[126],"results":[127,131],"OCO,":[129],"our":[130],"do":[132],"not":[133],"require":[134],"neither":[135],"assumption":[137],"gradient":[139],"boundedness,":[140],"nor":[141],"bounded":[145],"feasible":[146],"set.":[147],"Numerical":[148],"analyses":[149],"showcase":[150],"ability":[152],"dependence":[159],"on":[163],"class":[166],"condition":[167],"number.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-14T00:00:00"}