{"id":"https://openalex.org/W7171532127","doi":"https://doi.org/10.48550/arxiv.2607.23863","title":"Polynomial-time computation of $\\ell_p$-contraction fixed points for even $p$","display_name":"Polynomial-time computation of $\\ell_p$-contraction fixed points for even $p$","publication_year":2026,"publication_date":"2026-07-26","ids":{"openalex":"https://openalex.org/W7171532127","doi":"https://doi.org/10.48550/arxiv.2607.23863"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.23863","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23863","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.23863","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034822411","display_name":"Constantinos Daskalakis","orcid":"https://orcid.org/0000-0002-5451-0490"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daskalakis, Constantinos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070571735","display_name":"Gabriele Farina","orcid":"https://orcid.org/0000-0002-3976-0061"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farina, Gabriele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038658321","display_name":"Brian Hu Zhang","orcid":"https://orcid.org/0000-0002-1267-0170"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Brian Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.4050999879837036,"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.4050999879837036,"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/T11777","display_name":"Fixed Point Theorems Analysis","score":0.2558000087738037,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.16169999539852142,"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/fixed-point","display_name":"Fixed point","score":0.7445999979972839},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5098999738693237},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4810999929904938},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.4781999886035919},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4512999951839447},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4138000011444092},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4074999988079071},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3846000134944916},{"id":"https://openalex.org/keywords/kakutani-fixed-point-theorem","display_name":"Kakutani fixed-point theorem","score":0.3779999911785126}],"concepts":[{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.7445999979972839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6240000128746033},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4575999975204468},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4512999951839447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43689998984336853},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4138000011444092},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3846000134944916},{"id":"https://openalex.org/C134618013","wikidata":"https://www.wikidata.org/wiki/Q518524","display_name":"Kakutani fixed-point theorem","level":5,"score":0.3779999911785126},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3718999922275543},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.36000001430511475},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C105720234","wikidata":"https://www.wikidata.org/wiki/Q5456331","display_name":"Fixed-point property","level":3,"score":0.3122999966144562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3050999939441681},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2867000102996826},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2784999907016754},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C2780861221","wikidata":"https://www.wikidata.org/wiki/Q913849","display_name":"Minimax theorem","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.23863","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23863","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.23863","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23863","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,28,58],"$\\text{poly}(d,":[3,44],"p,":[4],"\\log(1/\u03b5))$-time":[5],"algorithm":[6,42],"that":[7,77],"computes":[8],"an":[9,35],"$\u03b5$-approximate":[10],"fixed":[11,49],"point":[12],"of":[13,62],"any":[14,48],"$\\ell_p$-nonexpansive":[15],"map":[16],"$f":[17],":":[18],"\\mathcal{X}":[19],"\\to":[20],"\\mathcal{X}$,":[21],"where":[22],"$\\mathcal{X}":[23],"\\subset":[24],"\\mathbb":[25],"R^d$":[26],"is":[27,34,39],"convex":[29],"compact":[30],"set":[31],"and":[32,69],"$p$":[33],"even":[36],"integer.":[37],"This":[38],"the":[40],"first":[41],"with":[43],"\\log(1/\u03b5))$":[45],"runtime":[46],"for":[47,65],"$p":[50],"\\ne":[51],"2$.":[52],"Our":[53],"techniques":[54],"are":[55],"based":[56],"on":[57],"computationally":[59],"efficient":[60],"version":[61],"Sion's":[63],"theorem":[64],"non-compact":[66],"minmax":[67],"problems,":[68],"extend":[70],"to":[71],"more":[72],"general":[73],"total":[74],"search":[75],"problems":[76],"admit":[78],"low-degree":[79],"polynomial":[80],"potentials.":[81]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-07-29T00:00:00"}