{"id":"https://openalex.org/W7155032759","doi":"https://doi.org/10.48550/arxiv.2604.17276","title":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","display_name":"Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem","publication_year":2026,"publication_date":"2026-04-19","ids":{"openalex":"https://openalex.org/W7155032759","doi":"https://doi.org/10.48550/arxiv.2604.17276"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.17276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2604.17276","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134136680","display_name":"Xinxin Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xinxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134187456","display_name":"Yudong Wei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei, Yudong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100396966","display_name":"Hao Zhang","orcid":"https://orcid.org/0000-0002-8226-0695"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Hao","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.7245000004768372,"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.7245000004768372,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.13249999284744263,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.020500000566244125,"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/projection","display_name":"Projection (relational algebra)","score":0.656499981880188},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5526999831199646},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5034999847412109},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5020999908447266},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.49869999289512634},{"id":"https://openalex.org/keywords/dykstras-projection-algorithm","display_name":"Dykstra's projection algorithm","score":0.4805000126361847},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.47839999198913574}],"concepts":[{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.656499981880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6197999715805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5999000072479248},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5526999831199646},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5020999908447266},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.49869999289512634},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.4805000126361847},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4562000036239624},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.43709999322891235},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.40470001101493835},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.35040000081062317},{"id":"https://openalex.org/C62799726","wikidata":"https://www.wikidata.org/wiki/Q190056","display_name":"Hilbert space","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3086000084877014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26249998807907104},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.17276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.17276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.17276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,23,60],"study":[1],"the":[2,11,77,115],"two-set":[3],"feasibility":[4,79],"problem":[5],"of":[6,15],"finding":[7],"a":[8,20,25,96,101],"point":[9],"in":[10,19,66,100,128],"intersection":[12],"$X\\cap":[13],"Y$":[14],"closed":[16],"convex":[17],"sets":[18],"Hilbert":[21],"space.":[22],"propose":[24],"generalized":[26,116],"composed":[27],"alternating":[28],"relaxed":[29],"projection":[30,55],"algorithm":[31,51],"(gCARPA)":[32],"that":[33,104,114],"blends":[34],"Douglas-Rachford-type":[35],"and":[36,45,72,95,118],"projection-reflection-type":[37],"dynamics":[38],"via":[39,87],"an":[40,46,83],"outer":[41],"averaging":[42],"step":[43],"$\u03bc$":[44],"internal":[47],"relaxation":[48,117],"$(\u03b3,\u03b8,\u03b7)$.":[49],"The":[50],"contains":[52],"several":[53],"classical":[54],"methods":[56,127],"as":[57],"special":[58],"cases.":[59],"also":[61],"introduce":[62],"its":[63,74,119],"non-stationary":[64,120],"variant,":[65],"which":[67],"$(\u03b3_k,\u03b8_k,\u03b7_k)$":[68],"vary":[69],"over":[70],"iterations,":[71],"establish":[73],"convergence.":[75],"For":[76],"subspace":[78],"model,":[80],"we":[81],"derive":[82],"explicit":[84],"spectral":[85],"characterization":[86],"principal-angle":[88,109],"block":[89],"decompositions,":[90],"yielding":[91],"computable":[92],"subdominant-eigenvalue":[93],"factors":[94],"minimax":[97],"parameter-selection":[98],"recipe":[99],"symmetric":[102],"regime":[103],"targets":[105],"critical":[106],"damping":[107],"on":[108],"planes.":[110],"Numerical":[111],"experiments":[112],"illustrate":[113],"tuning":[121],"can":[122],"improve":[123],"or":[124],"match":[125],"baseline":[126],"problem-dependent":[129],"regimes.":[130]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-22T00:00:00"}