{"id":"https://openalex.org/W7225239661","doi":"https://doi.org/10.4171/zaa/1844","title":"On Dykstra\u2019s algorithm with Bregman projections","display_name":"On Dykstra\u2019s algorithm with Bregman projections","publication_year":2026,"publication_date":"2026-11-04","ids":{"openalex":"https://openalex.org/W7225239661","doi":"https://doi.org/10.4171/zaa/1844"},"language":"en","primary_location":{"id":"doi:10.4171/zaa/1844","doi":"https://doi.org/10.4171/zaa/1844","is_oa":true,"landing_page_url":"https://doi.org/10.4171/zaa/1844","pdf_url":null,"source":{"id":"https://openalex.org/S4210177496","display_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","issn_l":"0232-2064","issn":["0232-2064","1661-4534"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310316982","host_organization_name":"European Mathematical Society","host_organization_lineage":["https://openalex.org/P4310316982"],"host_organization_lineage_names":["European Mathematical Society"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4171/zaa/1844","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002999834","display_name":"Pedro Pinto","orcid":"https://orcid.org/0000-0002-8761-523X","observed_orcids":["https://orcid.org/0000-0002-8761-523X"]},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE","PT"],"is_corresponding":false,"raw_author_name":"Pedro Pinto","raw_affiliation_strings":["Technische Universit\u00e4t Darmstadt, Germany","University of Lisbon, Portugal"],"raw_orcid":"https://orcid.org/0000-0002-8761-523X","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"University of Lisbon, Portugal","institution_ids":["https://openalex.org/I141596103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091323905","display_name":"Nicholas Pischke","orcid":"https://orcid.org/0000-0003-1243-6787","observed_orcids":["https://orcid.org/0000-0003-1243-6787"]},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicholas Pischke","raw_affiliation_strings":["University of Bath, UK"],"raw_orcid":"https://orcid.org/0000-0003-1243-6787","affiliations":[{"raw_affiliation_string":"University of Bath, UK","institution_ids":["https://openalex.org/I51601045"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.86760039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9771000146865845,"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.9771000146865845,"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/T11545","display_name":"Advanced Banach Space Theory","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T12062","display_name":"Approximation Theory and Sequence Spaces","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/dykstra-s-algorithm","display_name":"Dykstra's algorithm","score":0.996999979019165},{"id":"https://openalex.org/keywords/bregman-projection","display_name":"Bregman projection","score":0.968999981880188},{"id":"https://openalex.org/keywords/convex-feasibility-problem","display_name":"convex feasibility problem","score":0.9399999976158142},{"id":"https://openalex.org/keywords/best-approximation","display_name":"best approximation","score":0.8939999938011169},{"id":"https://openalex.org/keywords/proof-mining","display_name":"proof mining","score":0.824999988079071},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.847000002861023},{"id":"https://openalex.org/keywords/strong-convergence","display_name":"strong convergence","score":0.7300000190734863},{"id":"https://openalex.org/keywords/infinite-dimensional-spaces","display_name":"infinite-dimensional spaces","score":0.7990000247955322},{"id":"https://openalex.org/keywords/polyhedra","display_name":"polyhedra","score":0.753000020980835}],"concepts":[{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.7936000227928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6226999759674072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5778999924659729},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5552999973297119},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5131000280380249},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4893999993801117},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.43720000982284546},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.39500001072883606},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.37720000743865967},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.35740000009536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34779998660087585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34209999442100525},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2957000136375427},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.28929999470710754},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4171/zaa/1844","doi":"https://doi.org/10.4171/zaa/1844","is_oa":true,"landing_page_url":"https://doi.org/10.4171/zaa/1844","pdf_url":null,"source":{"id":"https://openalex.org/S4210177496","display_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","issn_l":"0232-2064","issn":["0232-2064","1661-4534"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310316982","host_organization_name":"European Mathematical Society","host_organization_lineage":["https://openalex.org/P4310316982"],"host_organization_lineage_names":["European Mathematical Society"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4171/zaa/1844","doi":"https://doi.org/10.4171/zaa/1844","is_oa":true,"landing_page_url":"https://doi.org/10.4171/zaa/1844","pdf_url":null,"source":{"id":"https://openalex.org/S4210177496","display_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","issn_l":"0232-2064","issn":["0232-2064","1661-4534"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310316982","host_organization_name":"European Mathematical Society","host_organization_lineage":["https://openalex.org/P4310316982"],"host_organization_lineage_names":["European Mathematical Society"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2027711030","https://openalex.org/W7214330914","https://openalex.org/W4400499743","https://openalex.org/W2070220184","https://openalex.org/W146716711","https://openalex.org/W3001129719","https://openalex.org/W7098250356","https://openalex.org/W4391574861","https://openalex.org/W2245623460","https://openalex.org/W1133581237"],"abstract_inverted_index":{"We":[0],"provide":[1,46,68],"quantitative":[2,114],"results":[3,44],"on":[4],"the":[5,17,22,35,49,102,119,123],"asymptotic":[6],"behavior":[7],"of":[8,16,24,51,75,77,96,104,112,126],"Dykstra\u2019s":[9,19,127],"algorithm":[10,20],"with":[11,129],"Bregman":[12,26,130],"projections,":[13,27],"a":[14,40,54,69,110],"combination":[15],"well-known":[18],"and":[21,33,72,93],"method":[23,128],"cyclic":[25],"designed":[28],"to":[29],"find":[30],"best":[31],"approximations":[32],"solve":[34],"convex":[36],"feasibility":[37],"problem":[38],"in":[39,56,87,99,106,132],"non-orthogonal":[41],"setting.":[42],"The":[43],"we":[45,67,82,116],"arise":[47],"through":[48],"lens":[50],"proof":[52],"mining,":[53],"program":[55],"mathematical":[57],"logic":[58],"which":[59,88],"extracts":[60],"computational":[61],"information":[62],"from":[63],"non-effective":[64],"proofs.":[65],"Concretely,":[66],"highly":[70],"uniform":[71],"computable":[73],"rate":[74],"metastability":[76],"low":[78],"complexity":[79],"and,":[80],"moreover,":[81],"also":[83,117],"specify":[84],"general":[85],"circumstances":[86],"one":[89],"can":[90],"obtain":[91],"full":[92],"effective":[94],"rates":[95],"convergence,":[97],"which,":[98],"particular,":[100],"contain":[101],"case":[103],"polyhedra":[105],"Euclidean":[107],"spaces.":[108,135],"As":[109],"byproduct":[111],"our":[113],"analysis,":[115],"for":[118],"first":[120],"time":[121],"establish":[122],"strong":[124],"convergence":[125],"projections":[131],"suitable":[133],"infinite-dimensional":[134]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-11-05T00:00:00"}