{"id":"https://openalex.org/W7214748418","doi":"https://doi.org/10.48550/arxiv.2609.34101","title":"On the Optimal Linear Minimization Oracle Complexity of Active-Hull Methods for Minimizing Convex H\u00f6lder Smooth Functions","display_name":"On the Optimal Linear Minimization Oracle Complexity of Active-Hull Methods for Minimizing Convex H\u00f6lder Smooth Functions","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214748418","doi":"https://doi.org/10.48550/arxiv.2609.34101"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.34101","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34101","pdf_url":"https://arxiv.org/pdf/2609.34101","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.34101","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002868460","display_name":"Renbo Zhao","orcid":"https://orcid.org/0000-0002-8226-9243","observed_orcids":["https://orcid.org/0000-0002-8226-9243"]},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhao, Renbo","raw_affiliation_strings":["Tippie College of Business , University of Iowa , Iowa City , IA 52242"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tippie College of Business , University of Iowa , Iowa City , IA 52242","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002868460"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.8633000254631042,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.8633000254631042,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.06679999828338623,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03610000014305115,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-minimization-oracle","display_name":"linear minimization oracle","score":0.777999997138977},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.6539999842643738},{"id":"https://openalex.org/keywords/primal-dual-splitting","display_name":"primal-dual splitting","score":0.7730000019073486},{"id":"https://openalex.org/keywords/oracle-complexity","display_name":"oracle complexity","score":0.6299999952316284},{"id":"https://openalex.org/keywords/parameter-free-algorithms","display_name":"parameter-free algorithms","score":0.7549999952316284},{"id":"https://openalex.org/keywords/composite-optimization","display_name":"composite optimization","score":0.43299999833106995},{"id":"https://openalex.org/keywords/first-order-methods","display_name":"first-order methods","score":0.6000000238418579},{"id":"https://openalex.org/keywords/high-dimensional-optimization","display_name":"high-dimensional optimization","score":0.5519999861717224}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6370999813079834},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6176999807357788},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5889999866485596},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5834000110626221},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49050000309944153},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.4851999878883362},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4765999913215637},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.44179999828338623},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.43220001459121704},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4101000130176544},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.39320001006126404},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31150001287460327},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.30570000410079956},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2770000100135803},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27320000529289246},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.2644999921321869},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.25540000200271606}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.34101","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34101","pdf_url":"https://arxiv.org/pdf/2609.34101","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2609.34101","doi":"https://doi.org/10.48550/arxiv.2609.34101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.34101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.34101","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.34101","pdf_url":"https://arxiv.org/pdf/2609.34101","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214748418.pdf","grobid_xml":"https://content.openalex.org/works/W7214748418.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1517483307","https://openalex.org/W4290858305"],"related_works":["https://openalex.org/W4403851157","https://openalex.org/W2213102012","https://openalex.org/W2950972350","https://openalex.org/W7131827551","https://openalex.org/W7222509969","https://openalex.org/W7206196567","https://openalex.org/W7172493359","https://openalex.org/W4405254021","https://openalex.org/W4414474300","https://openalex.org/W7222425260"],"abstract_inverted_index":{"We":[0,66],"consider":[1],"the":[2,45,57,62,70,75,78,83,96,99,105,111,130,157],"convex":[3,18,29,58],"problem":[4,131],"$(P):":[5],"{\\min}_{y\\in":[6],"\\mathbb{R}^n}\\,":[7],"f(Ay)+g(y)$,":[8],"where":[9,93],"$A:\\mathbb{R}^n\\to":[10],"\\mathbb{R}^m$":[11],"is":[12,17,26,91,115],"a":[13,34,52,118],"linear":[14,36],"operator,":[15],"$f$":[16],"and":[19,24,32,50,102,136],"$(M,\u03bd)$-H\u00f6lder":[20],"smooth":[21],"on":[22,30],"$\\mathbb{R}^m$,":[23],"$g$":[25],"proper,":[27],"closed":[28],"$\\mathbb{R}^n$,":[31],"admits":[33],"(generalized)":[35],"minimization":[37],"oracle":[38],"(LMO).":[39],"An":[40],"active-hull":[41],"(AH)":[42],"method":[43,126],"calls":[44],"LMO":[46,64,80,113,165],"in":[47,56,74,163],"each":[48],"iteration":[49],"outputs":[51],"point":[53],"that":[54,68,144],"lies":[55],"hull":[59],"of":[60,85,98,129,159],"all":[61],"past":[63],"returns.":[65],"show":[67],"under":[69],"Euclidean":[71],"geometry":[72],"(and":[73],"high-dimensional":[76],"regime),":[77],"optimal":[79,112],"complexity":[81,114],"for":[82],"class":[84],"AH":[86],"methods":[87],"to":[88,146],"solve":[89],"$(P)$":[90],"$O\\big(M^{{2}/({1+\u03bd})}D^2\\varepsilon^{-{2}/({1+\u03bd})}\\big)$,":[92],"$D$":[94,135],"denotes":[95,104],"diameter":[97],"feasible":[100],"region":[101],"$\\varepsilon$":[103],"objective":[106],"sub-optimality":[107],"gap.":[108],"In":[109],"particular,":[110],"achieved":[116],"by":[117],"single-loop":[119],"first-order":[120],"primal-dual":[121],"splitting":[122],"method.":[123],"Since":[124],"this":[125,148],"requires":[127],"knowledge":[128],"parameters":[132],"(e.g.,":[133],"$M$,":[134],"$\u03bd$),":[137],"we":[138],"propose":[139],"two":[140],"meta":[141],"parameter-search":[142],"algorithms":[143,151],"aim":[145],"resolve":[147],"issue.":[149],"These":[150],"are":[152],"parameter-free,":[153],"but":[154],"come":[155],"with":[156],"price":[158],"an":[160],"additional":[161],"log-factor":[162],"their":[164],"complexities.":[166]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-30T00:00:00"}