{"id":"https://openalex.org/W4415367660","doi":"https://doi.org/10.1109/isit63088.2025.11195506","title":"Fundamental Limits for Iterated Function Optimization on Turing Machines","display_name":"Fundamental Limits for Iterated Function Optimization on Turing Machines","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367660","doi":"https://doi.org/10.1109/isit63088.2025.11195506"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195506","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5000732219","display_name":"Holger Boche","orcid":"https://orcid.org/0000-0002-8375-8946"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Holger Boche","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology,Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology,Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034863939","display_name":"Volker Pohl","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Volker Pohl","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology,Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology,Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042307561","display_name":"H. Vincent Poor","orcid":"https://orcid.org/0000-0002-2062-131X"},"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":"H. Vincent Poor","raw_affiliation_strings":["Princeton University,Department of Electrical and Computer Engineering,Princeton,USA"],"affiliations":[{"raw_affiliation_string":"Princeton University,Department of Electrical and Computer Engineering,Princeton,USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000732219"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31048572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9520000219345093,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9520000219345093,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9280999898910522,"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/T10320","display_name":"Neural Networks and Applications","score":0.9236000180244446,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6223000288009644},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5724999904632568},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5656999945640564},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5008999705314636},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4844000041484833},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4715000092983246},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4562999904155731},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44269999861717224}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6223000288009644},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5724999904632568},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5656999945640564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5443999767303467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5440000295639038},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4844000041484833},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4715000092983246},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4562999904155731},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44269999861717224},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4408999979496002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43389999866485596},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43059998750686646},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.384799987077713},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.3522999882698059},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.32100000977516174},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.28929999470710754},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.28029999136924744}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195506","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G481716612","display_name":null,"funder_award_id":"ECCS-2335876","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W125135646","https://openalex.org/W562372631","https://openalex.org/W1497475168","https://openalex.org/W1545819195","https://openalex.org/W1568307856","https://openalex.org/W1827134935","https://openalex.org/W1968154520","https://openalex.org/W1979089199","https://openalex.org/W2000769684","https://openalex.org/W2022731279","https://openalex.org/W2029236670","https://openalex.org/W2063002186","https://openalex.org/W2067459389","https://openalex.org/W2082639035","https://openalex.org/W2095984592","https://openalex.org/W2111451941","https://openalex.org/W2126160338","https://openalex.org/W2129131372","https://openalex.org/W2132201981","https://openalex.org/W2137607133","https://openalex.org/W2148986322","https://openalex.org/W2161473225","https://openalex.org/W2537515126","https://openalex.org/W2611328865","https://openalex.org/W4226146578","https://openalex.org/W4243563333","https://openalex.org/W4250589301","https://openalex.org/W4300098446","https://openalex.org/W4377224548","https://openalex.org/W4390187812","https://openalex.org/W4392152316","https://openalex.org/W4396986789","https://openalex.org/W4396988604","https://openalex.org/W4401567372"],"related_works":[],"abstract_inverted_index":{"This":[0,91],"paper":[1,111],"studies":[2],"the":[3,28,35,38,50,100],"effective":[4],"convergence":[5],"of":[6,37,88],"iterative":[7,39,78],"methods":[8],"for":[9,115],"solving":[10],"convex":[11,68],"minimization":[12],"problems":[13],"using":[14],"block":[15,76],"Gauss\u2013Seidel":[16],"algorithms.":[17],"It":[18,46],"investigates":[19],"whether":[20],"it":[21,56,94],"is":[22,47,52,57,67,95,108],"always":[23],"possible":[24],"to":[25,84,97],"algorithmically":[26,98],"terminate":[27,99],"iteration":[29,101],"in":[30,69],"such":[31,102],"a":[32,62,75,104],"way":[33],"that":[34,49,59,93,103],"outcome":[36],"algorithm":[40],"satisfies":[41],"any":[42,87],"predefined":[43],"error":[44],"bound.":[45],"shown":[48,58],"answer":[51],"generally":[53],"negative.":[54],"Specifically,":[55],"even":[60],"if":[61],"computable":[63,73],"continuous":[64],"function":[65],"which":[66],"each":[70],"variable":[71],"possesses":[72],"minimizers,":[74],"Gauss-Seidel":[77],"method":[79],"might":[80],"not":[81],"be":[82],"able":[83],"effectively":[85],"compute":[86],"these":[89],"minimizers.":[90],"means":[92],"impossible":[96],"given":[105],"performance":[106],"guarantee":[107],"satisfied.":[109],"The":[110],"discusses":[112],"two":[113],"reasons":[114],"this":[116],"behavior":[117],"and":[118,121],"gives":[119],"simple":[120],"concrete":[122],"examples.":[123]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}